Catalog search for XML data sources in peer-to-peer systems

Authors:
Ying Yang;Jia-jin Le
Affiliations:
College of Information, University of DongHua, Shanghai, P.R.China;College of Information, University of DongHua, Shanghai, P.R.China
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 7
Cited 0

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
Complex Queries in DHT-based Peer-to-Peer Networks

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
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Processing queries in a large peer-to-peer system

CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A core challenge in peer-to-peer systems is efficient location of large numbers of nodes or data sources. This paper proposes a novel catalog search for the large distributed XML data sources based on consistent hashing, and the improved algorithm is given to speed the key location. Utilizing this model with data summary can quickly process queries for XML repositories. Results from performance simulation show that our approach has significant improvement.