21st International Conference on Data Engineering (ICDE'05)
DOI: 10.1109/icde.2005.115
|View full text |Cite
|
Sign up to set email alerts
|

Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
103
0

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 128 publications
(103 citation statements)
references
References 11 publications
0
103
0
Order By: Relevance
“…To overcome these limitations, super peer topologies were proposed, where dedicated nodes take the responsibility for index maintenance and access [29,30]. While these systems scale better, they require peers with very good network connections and high availability to cope with the workload imposed by these tasks.…”
Section: P2p Information Retrievalmentioning
confidence: 99%
See 1 more Smart Citation
“…To overcome these limitations, super peer topologies were proposed, where dedicated nodes take the responsibility for index maintenance and access [29,30]. While these systems scale better, they require peers with very good network connections and high availability to cope with the workload imposed by these tasks.…”
Section: P2p Information Retrievalmentioning
confidence: 99%
“…For each related cluster, the virtual peer computes the partial cosine similarity based on the retrieved scores. Then (lines [23][24][25][26][27][28][29][30][31], for the µ clusters with the highest partial cosine similarity, it sends its Bloom filter to the peer that holds the cluster's centroid (the cache peer), and retrieves the expected overlap size (cf. Eqn.…”
Section: Joining Peers In the Clustering-enhanced Algorithmmentioning
confidence: 99%
“…To update the index they use a LRU strategy. Similar, [5] uses a local routing index for content provider shortcuts for the specific scenario of top k retrieval in P2P networks. Local indices are maintained in a static super-peer network.…”
Section: Related Workmentioning
confidence: 99%
“…-Similar to file sharing networks each peer may publish all resources from its local content database, so other peers can discover them by its requests (this also applies to resources downloaded from other peers). All information is wrapped as RDF statements and stored in an RDF repository 5 . Additionally to local meta data (MMusen isOrganizerOf ISWC2005) each resource is assigned a topic (ISWC2005 isTypeOf SemanticWebConference) and hierarchical information about the topics is stored (SemanticWebConference subTopicOf Conference).…”
Section: Basic Building Blocks Of An Inga Peermentioning
confidence: 99%
“…Yu et al (2001) used histograms and considered the information of past queries in top-N query evaluation. Balke et al (2005) and Vlachou et al (2008) developed methods to optimize the communication costs in P2P networks. Zhao et al (2007) proposed the algorithm BRANCA for performing top-N retrieval in distributed environments.…”
Section: Related Workmentioning
confidence: 99%