Skip to Main content Skip to Navigation
Conference papers

SDR-tree: a Scalable Distributed Rtree

Abstract : We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on clusters of interconnected servers. SD-Rtree generalizes the well-known Rtree structure. It uses a distributed balanced binary spatial 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 the splits can make outdated. This may generate addressing errors, solved by the forwarding among the servers. Specific messages towards the clients incrementally correct the outdated images.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01125245
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:03:34 AM
Last modification on : Wednesday, September 23, 2020 - 4:28:03 AM

Identifiers

  • HAL Id : hal-01125245, version 1

Citation

Cedric Du Mouza, Witold Litwin, Philippe Rigaux. SDR-tree: a Scalable Distributed Rtree. ICDE'07 IEEE Intl. Conf. on Data Engineering, Jan 2007, X, France. pp.296-305. ⟨hal-01125245⟩

Share

Metrics

Record views

219