PRoBe: Multi-dimensional Range Queries in P2P Networks

Structured P2P systems are effective for exact key searches in a distributed environment as they offer scalability, self-organization, and dynamicity. These valuable properties also make them a candidate for more complex queries, such as range queries. In this paper, we describe PRoBe, a system that supports range queries over multiple attributes in P2P networks. PRoBe uses a multi-dimensional logical space for this purpose and maps data items onto this space based on their attribute values. The logical space is divided into hyper-rectangles, each maintained by a peer in the system. The range queries correspond to hyper-rectangles which are answered by forwarding the query to the peers responsible for overlapping regions of the logical space. We also propose load balancing techniques and show how cached query answers can be utilized for the efficient evaluation of similar range queries. The performance of PRoBe and the effects of various parameters are analyzed through a simulation study.

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

[2]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[3]  Beng Chin Ooi,et al.  An adaptive peer-to-peer network for distributed caching of OLAP results , 2002, SIGMOD '02.

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

[5]  Manish Parashar,et al.  Enabling flexible queries with guarantees in P2P systems , 2004, IEEE Internet Computing.

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

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

[8]  Beng Chin Ooi,et al.  PeerDB: a P2P-based system for distributed data sharing , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[9]  Shahram Ghandeharizadeh,et al.  PePeR: A Distributed Range Addressing Space for Peer-to-Peer Systems , 2003, DBISP2P.

[10]  Jeffrey Considine,et al.  Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.

[11]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[12]  Sandhya Dwarkadas,et al.  Peer-to-peer information retrieval using self-organizing semantic overlay networks , 2003, SIGCOMM '03.

[13]  Scott Shenker,et al.  Querying the Internet with PIER , 2003, VLDB.

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

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

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

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

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

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

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

[21]  Divyakant Agrawal,et al.  Range addressable network: a P2P cache architecture for data ranges , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[22]  Renée J. Miller,et al.  Mapping data in peer-to-peer systems: semantics and algorithmic issues , 2003, SIGMOD '03.

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

[24]  Randolph Y. Wang,et al.  SkipIndex : Towards a Scalable Peer-to-Peer Index Service for High Dimensional Data , 2004 .

[25]  Zhichen Xu,et al.  Building Low-maintenance Expressways for P2P Systems , 2002 .

[26]  Ashwin Machanavajjhala,et al.  An indexing framework for peer-to-peer systems , 2004, SIGMOD '04.

[27]  Divyakant Agrawal,et al.  Techniques for efficient routing and load balancing in content-addressable networks , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[28]  David R. Karger,et al.  Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems , 2004, IPTPS.

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

[30]  Christian Scheideler,et al.  Peer-to-peer systems for prefix search , 2003, PODC '03.

[31]  Vijay Gopalakrishnan,et al.  Efficient Peer-To-Peer Searches Using Result-Caching , 2003, IPTPS.

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

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

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

[35]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[36]  Ashwin Machanavajjhala,et al.  P-Ring: An Index Structure for Peer-to-Peer Systems , 2004 .

[37]  Pedro A. Szekely,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Proceedings. First Latin American Web Congress.

[38]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.