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

Authors:
Rong Zhang;Weining Qian;Minqi Zhou;Aoying Zhou
Affiliations:
Fudan University, China;East China Normal University, China;Fudan University, China;Fudan University, China
Venue:
Proceedings of the 2nd international conference on Scalable information systems
Year:
2007

Citing 16
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Multidimensional binary search trees used for associative searching

Communications of the ACM
Indexing Techniques for Advanced Database Systems

Indexing Techniques for Advanced Database Systems
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Flexible Information Discovery in Decentralized Distributed Systems

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Scalable, Efficient Range Queries for Grid Information Services

P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Peer-to-peer information retrieval using self-organizing semantic overlay networks

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Multi-dimensional range queries in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
A Peer-to-peer Framework for Caching Range Queries

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BATON: a balanced tree structure for peer-to-peer networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Adapting the content native space for load balanced indexing

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
CISS: an efficient object clustering framework for DHT-Based peer-to-peer applications

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
An efficient indexing method for nearest neighbor searches inhigh-dirnensional image databases

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

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.