Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Data Indexing in Peer-to-Peer DHT Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
XPath lookup queries in P2P networks
Proceedings of the 6th annual ACM international workshop on Web information and data management
Locating data sources in large distributed systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Bloom histogram: path selectivity estimation for XML data with updates
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A Practical Approach to Network Size Estimation for Structured Overlays
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
XML processing in DHT networks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Locating XML Documents in a Peer-to-Peer Network Using Distributed Hash Tables
IEEE Transactions on Knowledge and Data Engineering
Efficient processing of XPath queries with structured overlay networks
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
DHT-based structured P2P systems have been proposed to index and retrieve many types of contents, including distributed collections of XML documents. During the query processing, a DHT can be used to efficiently identify all nodes storing relevant documents. Most of the DHT-based systems in literature break a complex XML tree pattern query into a set of simple path queries. Each of such queries is separately looked up in the P2P network to locate relevant nodes. The intersection of the results over each single path produces the set of nodes storing documents matching the original query. The network traffic generated by this strategy increases with the number of paths in the query. To overcome this issue, an alternative strategy consists in resolving only the sub-query associated to the most selective path; then all nodes in the result set are queried with the original query. The main goal of this paper is providing an analytical and experimental study of the two approaches to assess their relative merits in different scenarios. On the basis of this study, we also introduce an Adaptive Path Selection (APS) search technique which resolves a multi-path XML query by querying either the most selective path or the whole path set, based on the selectivity of the paths in that query. Experimental results confirm that APS saves a significant amount of network traffic as compared to the two strategies from which it derives.