Paper Info
Title
Discovering and exploiting keyword and attribute-value co-occurrences to improve P2P routing indices
Abstract
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.
Year
DOI
Venue
2006
10.1145/1183614.1183643
CIKM
Keywords
Field
DocType
poor search result quality,data item,p2p network,query routing,decentralized directory,web data,coarse granularity,additional search result,attribute-value co-occurrences,p2p routing index,additional multi-key statistic,best peer,p2p
Data mining,Information retrieval,Directory,Computer science,Hash function,Granularity,Scalability,Sketch
Conference
ISBN
Citations 
PageRank 
1-59593-433-2
30
0.95
References 
Authors
36
6
Name
Order
Citations
PageRank
Sebastian Michel194658.72
matthias bender230914.34
Nikos Ntarmos321915.40
Peter Triantafillou41261151.76
Gerhard Weikum5127102146.01
Christian Zimmer628213.36