Name
Abstract | ||
|---|---|---|
There exist a number of approaches for query processing in Peer-to-Peer information systems that efficiently retrieve relevant information from distributed peers. However, very few of them take into consideration the overlap between peers: as the most popular resources (e.g., documents or files) are often present at most of the peers, a large fraction of the documents eventually received by the query initiator are duplicates. We develop a technique based on the notion of global document occurrences (GDO) that, when processing a query, penalizes frequent documents increasingly as more and more peers contribute their local results. We argue that the additional effort to create and maintain the GDO information is reasonably low, as the necessary information can be piggybacked onto the existing communication. Early experiments indicate that our approach significantly decreases the number of peers that have to be involved in a query to reach a certain level of recall and, thus, decreases user-perceived latency and the wastage of network resources. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11575771_21 | OTM Conferences (1) |
Keywords | Field | DocType |
peer-to-peer information system,gdo information,additional effort,relevant information,global document occurrence,existing communication,necessary information,query processing,certain level,query initiator,early experiment | Information system,World Wide Web,Database query,Resource (disambiguation),Peer-to-peer,Computer science,Latency (engineering),Retard,Recall,Distributed computing | Conference |
Volume | ISSN | ISBN |
3760 | 0302-9743 | 3-540-29736-7 |
Citations | PageRank | References |
3 | 0.38 | 29 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Odysseas Papapetrou | 1 | 230 | 17.87 |
| Sebastian Michel | 2 | 946 | 58.72 |
| matthias bender | 3 | 309 | 14.34 |
| Gerhard Weikum | 4 | 12710 | 2146.01 |