Efficient range queries in spatial databases over Peer-to-Peer Networks

Peer-to-Peer (P2P) network, e.g., Chord, is designed mainly for one-dimensional data retrieval and point queries. Multimedia and spatial applications require efficient execution of range queries. This paper proposes an efficient scheme to support range query over Chord while balancing the storage load. The paper proposes a rotating token scheme that places the joining nodes in appropriate locations to share loads with overloaded nodes. To support range queries, we utilise an order-preserving mapping function to map keys to nodes in an order preserving manner. Simulation experiments show significant gain in storage load balancing and the performance of range queries over Chord.

[1]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM 2004.

[2]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

[3]  Anirban Mondal,et al.  P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments , 2004, EDBT Workshops.

[4]  Hector Garcia-Molina,et al.  One torus to rule them all: multi-dimensional queries in P2P systems , 2004, WebDB '04.

[5]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[6]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[7]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[8]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[9]  Dan Suciu,et al.  What Can Database Do for Peer-to-Peer? , 2001, WebDB.

[10]  David R. Karger,et al.  Looking up data in P2P systems , 2003, CACM.

[11]  Hector Garcia-Molina,et al.  Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems , 2004, VLDB.

[12]  Hanan Samet,et al.  A distributed quadtree index for peer-to-peer settings , 2005, 21st International Conference on Data Engineering (ICDE'05).

[13]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[14]  Sriram Ramabhadran,et al.  Brief announcement: prefix hash tree , 2004, PODC '04.

[15]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[16]  Divyakant Agrawal,et al.  Approximate Range Selection Queries in Peer-to-Peer Systems , 2003, CIDR.

[17]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[18]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[19]  Beng Chin Ooi,et al.  BATON: A Balanced Tree Structure for Peer-to-Peer Networks , 2005, VLDB.

[20]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2006, Theory of Computing Systems.

[21]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[22]  Renyi Xiao,et al.  Survey on Anonymity in Unstructured Peer-to-Peer Systems , 2008, Journal of Computer Science and Technology.

[23]  Roger Zimmermann,et al.  ASPEN: an adaptive spatial peer-to-peer network , 2005, GIS '05.

[24]  Jorge Raúl Ardenghi,et al.  Peer-to-Peer Systems: The Present and the Future , 2007 .

[25]  Artur Andrzejak,et al.  Scalable, efficient range queries for grid information services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[26]  Mohamed A. Soliman,et al.  A Survey of Data Management in Peer-to-Peer Systems , 2005 .

[27]  Maha Abdallah,et al.  Scalable Range Query Processing for Large-Scale Distributed Database Applications , 2005, IASTED PDCS.

[28]  Johan A. Pouwelse,et al.  The Bittorrent P2P File-Sharing System: Measurements and Analysis , 2005, IPTPS.

[29]  Johannes Gehrke,et al.  Querying peer-to-peer networks using P-trees , 2004, WebDB '04.

[30]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[31]  Divyakant Agrawal,et al.  A peer-to-peer framework for caching range queries , 2004, Proceedings. 20th International Conference on Data Engineering.

[32]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[33]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[34]  Jonathan Kirsch,et al.  Load balancing and locality in range-queriable data structures , 2004, PODC '04.