Abstract | ||
---|---|---|
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arrange participating sites in a topic-segmented overlay topology in which most connections are short-distance, connecting pairs of sites with similar content. Topically focused sets of sites are then joined together into a single network by long-distance links. Queries are matched and routed to only the topically closest regions. We discuss a variety of design issues and tradeoffs that an implementor of SETS would face. We show that SETS is efficient in network traffic and query processing load. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1145/860435.860491 | SIGIR |
Keywords | Field | DocType |
distributed information retrieval,network traffic,long-distance link,topic segments,topic-driven query routing,query processing load,single network,small world networks,topically closest region,topic segmentation,peer-to-peer network,key idea,social network theory,efficient search,design issue,peer-to-peer p2p,small world network,p2p,distributed systems,machine learning | Overlay topology,Architecture,Social network,Information retrieval,Segmentation,Computer science,Small-world network,Theoretical computer science | Conference |
ISBN | Citations | PageRank |
1-58113-646-3 | 111 | 5.92 |
References | Authors | |
29 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mayank Bawa | 1 | 1095 | 57.78 |
Gurmeet Singh Manku | 2 | 1589 | 139.26 |
Prabhakar Raghavan | 3 | 13351 | 2776.61 |