research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:
TitleDiscovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve P2P Routing Indices
Bibtex cite IDRACTI-RU1-2006-9
Booktitle 15th ACM Conference on Information and Knowledge Management (CIKM 2006)
Year published 2006
Month November
Peer-to-Peer (P2P) search requires intelligent decisions for query routing: selecting the best peers to which a given query, initiated at some peer, should be forwarded for retrieving additional search results. These decisions are based on statistical summaries for each peer, which are usually organized on a per-keyword basis and managed in a distributed directory of routing indices. Such architectures disregard the possible correlations among keywords. Together with the coarse granularity of per-peer summaries, which are mandated for scalability, this limitation may lead to poor search result quality. This paper develops and evaluates two solutions to this problem, sk-STAT based on single-key statistics only, and mk-STAT based on additional multi-key statistics. For both cases, hash sketch synopses are used to compactly represent a peer's data items and are efficiently disseminated in the P2P network to form a decentralized directory. Experimental studies with Gnutella and Web data demonstrate the viability and the trade-offs of the approaches.
Bender, Matthias
Michel, Sebastian
Ntarmos, Nikos
Triantafillou, Peter
Weikum, Gerhard
Zimmer, Christian
cikm396.pdf (main file)
Publication ID52