Thumbnail - No thumbnail

SD-Rtree: a Scalable Distributed Rtree

du Mouza, Cedric; Litwin, Witold; Rigaux, Philippe (2007), SD-Rtree: a Scalable Distributed Rtree, ICDE'07 IEEE Intl. Conf. on Data Engineering, IEEE - Institute of Electrical and Electronics Engineers : Piscataway, NJ, p. 296-305. 10.1109/ICDE.2007.367875

Voir/Ouvrir
Type
Communication / Conférence
Date
2007
Titre du colloque
23rd International Conference on Data Engineering (ICDE 2007)
Date du colloque
2007-04
Ville du colloque
Istanbul
Pays du colloque
Turkey
Titre de l'ouvrage
ICDE'07 IEEE Intl. Conf. on Data Engineering
Éditeur
IEEE - Institute of Electrical and Electronics Engineers
Ville d’édition
Piscataway, NJ
Isbn
1-4244-0803-2
Pages
296-305
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
du Mouza, Cedric

Litwin, Witold
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Rigaux, Philippe cc
Résumé (EN)
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.
Mots-clés
Indexing; spatialdata; distributed data structure