A revised R*-tree in comparison with related index structures

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 799-811

  Beckmann, Norbert ^a   Seeger, Bernhard ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

Choosesubtree; Hilbert r tree; Index structures; Multi dimensional data; Performance comparison; R tree; Revised r z.ast; tree; Rr z.ast; tree; Split

Indexed keywords

DATA DISTRIBUTION; EXPERIMENTAL COMPARISON; EXPERIMENTAL SETUP; HIGHER-DIMENSIONAL; HILBERT; INDEX STRUCTURE; MULTI-DIMENSIONAL DATASETS; MULTIDIMENSIONAL DATA; R-TREE INDEX STRUCTURE; REAL DATA SETS; SEARCH PERFORMANCE; SINGLE PATH; SPLIT ALGORITHMS; SUBSTANTIAL REDUCTION; SUBTREES; THREE-DIMENSIONAL DATA;

COMPETITION; DECISION TREES;

DATABASE SYSTEMS;

EID: 70849126056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559929     Document Type: Conference Paper

References (32)

1. L. Arge, M. Berg, H. Haverkort, K. Yi: The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358
2. C. Böhm, S. Berchtold, D. Keim: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys 33(3): 322-373 (2001).
3. J. L. Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517 (1975).
4. B. Becker, P. Franciosa, S. Gschwind, T. Ohler, G. Thiemt, P. Widmayer: Enclosing Many Boxes by an Optimal Pair of Boxes. STACS 1992: 475-486.
5. S. Berchtold, D. Keim, H.-P. Kriegel: The X-tree : An Index Structure for High-Dimensional Data. VLDB Conference 1996: 28-39.
6. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331.
7. J. van den Bercken, B. Seeger, P. Widmayer: A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997: 406-415.
8. Bureau of the Census: Tiger/Line Precensus Files: 1995 technical documentation, Bureau of the Census, Washington DC 1996.
9. M. Carey, D. DeWitt, M. Franklin, N. Hall, M. McAuliffe, J. Naughton, D. Schuh, M. Solomon, C. Tan, O. Tsatalos, S. White, M. Zwilling: Shoring Up Persistent Applications. SIGMOD Conference 1994: 383-394.
10. K. Chakrabarti, S. Mehrotra. The hybrid tree: An index structure for high dimensional feature spaces. ICDE 1999: 440-447.
11. K. Chakrabarti, S. Mehrotra: Efficient Concurrency Control in Multidimensional Access Methods. SIGMOD Conference 1999: 25-36.
12. http://www.mathematik.uni-marburg.de/~seeger/rrstar/, 2009.
13. C. Faloutsos, I. Kamel: Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension. PODS 1994: 4-13.
14. Y. Garća, M. Lopez, S. Leutenegger: On Optimal Node Splitting for R-trees. VLDB Conference 1998: 334-344.
15. A. Guttman. R-trees: A dynamic index structure for spatial searching. SIGMOD Conference 1984: 47-57, 1984.
16. J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems (Extended Abstract). VLDB Conference 1995: 562-573.
17. E. Hoel, H. Samet: Benchmarking Spatial Join Operations with Spatial Output. VLDB Conference 1995: 606-618.
18. IBM Informix R-tree Index, User's Guide, 2005. IBM Informix Dynamic Server v10 Information Center, Feb. 2009.
19. I. Kamel, C. Faloutsos, "Hilbert R-tree: An Improved R-tree Using Fractals", VLDB Conference 1994: 500-509.
20. M. Kornacker, C. Mohan, and J. M. Hellerstein. Concurrency and Recovery in Generalized Search Trees. SIGMOD Conference 1997: 62-72.
21. K. Kanth, S. Ravada, D. Abugov: Quadtree and R-tree Indexes in Oracle Spatial: A Comparison using GIS Data. SIGMOD Conference 2002.
22. K. Kanth, S. Ravada, J. Sharma, J. Banerjee: Indexing Medium-dimensionality Data in Oracle. SIGMOD Conference 1999: 521-522.
23. N. Katayama and S. Satoh, The sr-tree: An index structure for high-dimensional nearest neighbor queries, SIGMOD Conference 1997: 369-380.
24. Y. Manolopoulos, A. Nanopoulos, A.N. Papadopoulos, Y. Theodoridis: R-trees: Theory and Applications, Springer, 2005.
25. MySQL 5.0 Reference Manual, http://downloads.mysql.com/docs/refman-5.0- en.a4.pdf, 2008.
26. W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, and G. Taubin. The QPIC project: Quering images by content using color, texture, and shape. Poc. of the SPIE Conference on Storage and Retrieval for Image and Video Databases, 2-3 February '93, San Jose, CA, pages 173-187, 1993.
27. The PostgreSQL Comprehensive Manual, http://www.postgresql.org/docs/ manuals/
28. B.-U. Pagel, H.-W. Six, H. Toben, P. Widmayer: Towards an Analysis of Range Query Performance in Spatial Data Structures. PODS 1993: 214-221.
29. B.-U. Pagel, H.-W. Six, M. Winter: Window Query- Optimal Clustering of Spatial Objects. PODS 1995: 86-94.
30. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima: "The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation", VLDB Conference 2000: 516--526.
31. UC Irvine KDD Archive, http://kdd.ics.uci.edu/, 2002.
32. J. Weinberger: SpatialWare Extends Microsoft SQL Server Capabilities. MapInfo Magazine 6(2), 2001