SG2 : A novel index structure for efficient data management in super-peer architecture

Peer-to-peer (P2P) computing is a prominent technology for implementing large-scale distributed systems. Because of its advantages such as high availability, high performance, and high flexibility to the dynamics of networks, P2P has received much attention in research communities. However, multidimensional data indexing and efficient data management in the P2P computing remains a big challenge. In this paper, we proposed a new index structure for super peer P2P, called SG2 index structure, for supporting range query in a multi-dimensional data space. We also discuss the issue of providing high-level data management services including update efficiency. The structure proposed in this paper is designed so as to realize high scalability and efficiency for searching in a high dimensional database.

[1]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[2]  Wolfgang Nejdl,et al.  Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks , 2003, WWW '03.

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

[4]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

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

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

[7]  Mark Handley,et al.  Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

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

[9]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.

[10]  Jianliang Xu,et al.  m-LIGHT: Indexing Multi-Dimensional Data over DHTs , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[11]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[12]  Calvin C. Gotlieb,et al.  Order-preserving key transformations , 1986, TODS.

[13]  C.D. Buckingham,et al.  Pre-processing for Improved Query Routing in Super-peer P2P Systems , 2008, 2008 IEEE Region 5 Conference.

[14]  Theoni Pitoura,et al.  Replication, Load Balancing and Efficient Range Query Processing in DHTs , 2006, EDBT.

[15]  Ben Y. Zhao,et al.  Tapestry: a fault-tolerant wide-area application infrastructure , 2002, CCRV.

[16]  Evaggelia Pitoura,et al.  BITPEER: continuous subspace skyline computation with distributed bitmap indexes , 2008, DaMaP '08.

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

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

[19]  Masatoshi Yoshikawa,et al.  The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation , 2000, VLDB.

[20]  Christos Doulkeridis,et al.  Peer-to-Peer Similarity Search in Metric Spaces , 2007, VLDB.

[21]  Beng Chin Ooi,et al.  VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes , 2006, 22nd International Conference on Data Engineering (ICDE'06).