SDI: A swift tree structure for multi-dimensional data indexing in peer-to-peer networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and remains to be a challenge. In this paper, SDI, a new succinct multi-dimensional balanced tree structure based on peer-to-peer technology, is presented. With SDI structure, the query efficiency can be bounded by O(log N). Compared with previous tree-based methods, SDI has extremely low maintenance cost. This is due to the carefully chosen finger links. Furthermore, new algorithms are designed for both point query and range query processing, which make SDI free from the root-bottleneck problem. Experimental results validate the efficiency and effectiveness of the proposed approach.

Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference on Scalable Information Systems, InfoScale 2007
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781595937575
DOIs
StatePublished - 6 Jun 2007
Event2nd International Conference on Scalable Information Systems, InfoScale 2007 - Suzhou, China
Duration: 6 Jun 20078 Jun 2007

Publication series

NameACM International Conference Proceeding Series
Volume06-08-June-2007

Conference

Conference2nd International Conference on Scalable Information Systems, InfoScale 2007
Country/TerritoryChina
CitySuzhou
Period6/06/078/06/07

Keywords

  • Multi-dimensional data
  • Peer-to-peer
  • Point query
  • Range query

Fingerprint

Dive into the research topics of 'SDI: A swift tree structure for multi-dimensional data indexing in peer-to-peer networks'. Together they form a unique fingerprint.

Cite this