Efficient query evaluation on large textual collections in a peer-to-peer environment

Jiangong Zhang; Torsten Suel

doi:10.1109/P2P.2005.7

Efficient query evaluation on large textual collections in a peer-to-peer environment

Jiangong Zhang, Torsten Suel

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We study the problem of evaluating ranked (top-k) queries on textual collections ranging from multiple gigabytes 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.

Original language	English (US)
Title of host publication	Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005
Pages	225-233
Number of pages	9
DOIs	https://doi.org/10.1109/P2P.2005.7
State	Published - 2005
Event	5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005 - onstanz, Germany Duration: Aug 31 2005 → Sep 2 2005

Publication series

Name	Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005
Volume	2005

Other

Other	5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005
Country/Territory	Germany
City	onstanz
Period	8/31/05 → 9/2/05

ASJC Scopus subject areas

General Engineering

Access to Document

10.1109/P2P.2005.7

Cite this

Zhang, J., & Suel, T. (2005). Efficient query evaluation on large textual collections in a peer-to-peer environment. In Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005 (pp. 225-233). Article 1551045 (Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005; Vol. 2005). https://doi.org/10.1109/P2P.2005.7

Efficient query evaluation on large textual collections in a peer-to-peer environment. / Zhang, Jiangong; Suel, Torsten.
Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. 2005. p. 225-233 1551045 (Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhang, J & Suel, T 2005, Efficient query evaluation on large textual collections in a peer-to-peer environment. in Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005., 1551045, Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005, vol. 2005, pp. 225-233, 5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005, onstanz, Germany, 8/31/05. https://doi.org/10.1109/P2P.2005.7

@inproceedings{2eddee2d92704e97829d206a2a14fa32,

title = "Efficient query evaluation on large textual collections in a peer-to-peer environment",

abstract = "We study the problem of evaluating ranked (top-k) queries on textual collections ranging from multiple gigabytes 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.",

author = "Jiangong Zhang and Torsten Suel",

year = "2005",

doi = "10.1109/P2P.2005.7",

language = "English (US)",

isbn = "0769523765",

series = "Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005",

pages = "225--233",

booktitle = "Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005",

note = "5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005 ; Conference date: 31-08-2005 Through 02-09-2005",

}

TY - GEN

T1 - Efficient query evaluation on large textual collections in a peer-to-peer environment

AU - Zhang, Jiangong

AU - Suel, Torsten

PY - 2005

Y1 - 2005

N2 - We study the problem of evaluating ranked (top-k) queries on textual collections ranging from multiple gigabytes 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.

AB - We study the problem of evaluating ranked (top-k) queries on textual collections ranging from multiple gigabytes 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.

UR - http://www.scopus.com/inward/record.url?scp=33845351881&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845351881&partnerID=8YFLogxK

U2 - 10.1109/P2P.2005.7

DO - 10.1109/P2P.2005.7

M3 - Conference contribution

AN - SCOPUS:33845351881

SN - 0769523765

SN - 9780769523767

T3 - Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005

SP - 225

EP - 233

BT - Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005

T2 - 5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005

Y2 - 31 August 2005 through 2 September 2005

ER -

Efficient query evaluation on large textual collections in a peer-to-peer environment

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this