SD-Rtree: A scalable distributed Rtree

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 296-305

  Du Mouza, Cédric ^a   Litwin, Witold ^b   Rigaux, Philippe ^b  

^a University of Paris Cité   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; DATA STRUCTURES; PROBLEM SOLVING; QUERY PROCESSING; SERVERS;

BINARY SPATIAL TREE; SD-RTREE; WINDOW QUERIES;

BINARY TREES;

EID: 34548718163     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367875     Document Type: Conference Paper

References (15)

1. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*tree : An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD, pages 322-331, 1990.
2. A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram. Querying Peer-to-Peer Networks Using P-Trees. In Proc. Intl. Workshop on the Web and Databases (WebDB), pages 25-30, 2004.
3. R. Devine. Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm. In Foundations of Data Organization and Algorithms (FODO), 1993.
4. V. Gaede and O. Guenther. Multidimensional Access Methods. ACM Computing Surveys, 30(2), 1998.
5. Y. Garcia, M. Lopez, and S. Leutenegger. On Optimal Node Splitting for R-trees. In VLDB, 1998.
6. A. Guttman. R-trees : A Dynamic Index Structure for Spatial Searching. In SIGMOD, pages 45-57, 1984.
7. S. E. Hambrusch and A. A. Khokhar. Maintaining Spatial Data Sets in Distributed-Memory Machines. In Proc. Intl. Parallel Processing Symposium (IPPS), 1997.
8. H. Jagadish, B. C. Ooi, and Q. H. Vu. BATON: A Balanced Tree Structure for Peer-to-Peer Networks. In VLDB, pages 661-672, 2005.
9. H. Jagadish, B. C. Ooi, Q. H. Vu, R. Zhang, and A. Zhou. VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes. In Proc. Intl. Conf. on Data Engineering (ICDE), 2006.
10. J. S. Karlsson. hQT*: A Scalable Distributed Data Structure for High-Performance Spatial Accesses. In Foundations of Data Organization and Algorithms (FODO), 1998.
11. V. Kriakov, A. Delis, and G. Kollios. Management of Highly Dynamic Multidimensional Data in a Cluster of Workstations. In EDBT, pages 748-764, 2004.
12. W. Litwin and M.-A. Neimat. k-RP*S: A Scalable Distributed Data Structure for High-Performance Multi-Attribute Access. In Proc. Intl. Conf. on Parallel and Distributed Inf. Systems (PDIS), pages 120-131, 1996.
13. W. Litwin, M.-A. Neimat, and D. A. Schneider. RP*: A Family of Order Preserving Scalable Distributed Data Structures. In VLDB, pages 342-353, 1994.
14. W. Litwin, M.-A. Neimat, and D. A. Schneider. LH* - A Scalable, Distributed Data Structure. ACM Trans. on Database Systems, 21(4):480-525, 1996.
15. Y. Theodoridis, J. R. O. Silva, and M. A. Nascimento. On the Generation of Spatiotemporal Datasets. In Proc. Intl. Conf. on Large Spatial Databases (SSD), 1999.