Paper Info
Title
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Abstract
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in which the nodes in a P2P system store XML documents. We propose a fully decentralized approach to the problem of routing path queries among the nodes of a P2P system based on maintaining specialized data structures, called filters that efficiently summarize the content, i.e., the documents, of one or more node. Our proposed filters, called multi-level Bloom filters, are based on extending Bloom filters so that they maintain information about the structure of the documents. In addition, we advocate building a hierarchical organization of nodes by clustering together nodes with similar content. Similarity between nodes is related to the similarity between the corresponding filters. We also present an efficient method for update propagation. Our experimental results show that multi-level Bloom filters outperform the classical Bloom filters in routing path queries. Furthermore, the content-based hierarchical grouping of nodes increases recall, that is, the number of documents that are retrieved.
Year
DOI
Venue
2004
10.1007/978-3-540-24741-8_4
ADVANCES IN DATABASE TECHNOLOGY - EDBT 2004, PROCEEDINGS
Keywords
Field
DocType
p2p,bloom filter,xml document,data structure
Bloom filter,Data mining,Data structure,XML,Peer-to-peer,Computer science,Document Structure Description,Cluster analysis,Database,Scalability,Hierarchical organization
Conference
Volume
ISSN
Citations 
2992
0302-9743
69
PageRank 
References 
Authors
2.48
17
2
Name
Order
Citations
PageRank
Georgia Koloniari122016.49
evaggelia pitoura21968321.56