OID: Optimized Information Discovery Using Space Filling Curves in P2P Overlay Networks

In this paper, we present the system design and evaluation of a space filling curve (SFC)-based P2P information discovery system OID. The OID system uses multiple SFCs to significantly optimize the performance of multi-attribute range queries, particularly for applications with a large number of data attributes where a single big SFC-based index is inefficient. The basic idea is to have multiple SFC based indices and select the best one to perform a query. We also introduce two tree-based query optimizations that increase the scalability of the system.

[1]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.

[2]  Wolfgang Nejdl,et al.  Integrating Schema-specific Native XML Repositories into a RDF-based E-Learning P2P Network , 2002, Dublin Core Conference.

[3]  Beng Chin Ooi,et al.  Supporting multi-dimensional range queries in peer-to-peer systems , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[4]  Raouf Boutaba,et al.  Distributed pattern matching: a key to flexible and efficient P2P search , 2007, IEEE Journal on Selected Areas in Communications.

[5]  Yuval Shavitt,et al.  Geographical Statistics and Characteristics of P2P Query Strings , 2007, IPTPS.

[6]  Scott Shenker,et al.  Spurring Adoption of DHTs with OpenHash, a Public DHT Service , 2004, IPTPS.

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

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

[9]  Mary K. Vernon,et al.  Characterizing the query behavior in peer-to-peer file sharing systems , 2004, IMC '04.

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

[11]  Desh Ranjan,et al.  Space Filling Curves and Their Use in the Design of Geometric Data Structures , 1995, LATIN.

[12]  Manish Parashar,et al.  Flexible information discovery in decentralized distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

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

[14]  Sriram Ramabhadran,et al.  Prefix Hash Tree An Indexing Data Structure over Distributed Hash Tables , 2004, PODC 2004.

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

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

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

[18]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[19]  Theoni Pitoura,et al.  Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks , 2003, DBISP2P.

[20]  D. Hilbert.  Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .

[21]  Karl Aberer,et al.  Range queries in trie-structured overlays , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).