A Pruning-based Approach for Supporting Top-K Join Queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. This paper resolves this issue by proposing an efficient pruning-based approach to answer top-K join queries. The total amount of transmitted data can be greatly reduced by pruning tuples that can not produce the desired join results with a rank value greater than or equal to the rank value generated so far.
Liu, J., Feng, L., and Xing, Y. 2006. A pruning-based approach for supporting Top-K join queries. In Proceedings of the 15th International Conference on World Wide Web (Edinburgh, Scotland, May 23 - 26, 2006). WWW '06. ACM Press, New York, NY, 891-892.
Other items being presented by these speakers
Sponsor of The CIO Dinner