Peer-to-Peer Computing, IEEE International Conference on (2005)
Aug. 31, 2005 to Sept. 2, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2005.7
Torsten Suel , Polytechnic University
Jiangong Zhang , Polytechnic University
We study the problem of evaluating ranked (top-k) queries on textual collections ranging from multiple giga-bytes to terabytes in size. We focus on the case of a global index organization in a highly distributed environment, and consider a class of ranking functions that includes common variants of the Cosine and Okapi measures. The main bottleneck in such a scenario is the amount of communication required during query evaluation. We propose several efficient query evaluation schemes and evaluate their performance. Our results on real search engine query traces and over 120 million web pages show that after careful optimization such queries can be evaluated at a reasonable cost, while challenges remain for even larger collections and more general classes of ranking functions.
Torsten Suel, Jiangong Zhang, "Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment", Peer-to-Peer Computing, IEEE International Conference on, vol. 00, no. , pp. 225-233, 2005, doi:10.1109/P2P.2005.7