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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Multidimensional access methods
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Maintaining Spatial Data Sets in Distributed-Memory Machines
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Querying peer-to-peer networks using P-trees
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Supporting Complex Multi-Dimensional Queries in P2P Systems
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
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
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic storage balancing in a distributed spatial index
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point, window and kNN queries over large spatial datasets distributed on clusters of interconnected servers. The structure balances the storage and processing load over the available resources, and aims at minimizing the size of the cluster. SD-Rtree generalizes the well-known Rtree structure. It uses a distributed balanced binary tree that scales with insertions to potentially any number of storage servers through splits of the overloaded ones. A user/application manipulates the structure from a client node. The client addresses the tree through its image that can be possibly outdated due to later split. This may generate addressing errors, solved by the forwarding among the servers. Specific messages towards the clients incrementally correct the outdated images. We present the building of an SD-Rtree through insertions, focusing on the split and rotation algorithms. We follow with the query algorithms. We describe then a flexible allocation protocol which allows to cope with a temporary shortage of storage resources through data storage balancing. Experiments show additional aspects of SD-Rtree and compare its behavior with a distributed quadtree. The results justify our various design choices and the overall utility of the structure.