The 5-tree: An efficient index for multidimensional objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1262 LNCS, Issue , 1997, Pages 350-373

  Aggarwal, Charu ^a   Wolf, Joel ^a   Yu, Philip ^a   Epelman, Marina ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC DATABASE; MINIMUM BOUNDING RECTANGLE; MULTIDIMENSIONAL INDEX; MULTIDIMENSIONAL OBJECTS; PACKING ALGORITHMS; THEORETICAL BOUNDS;

DATABASE SYSTEMS; DECISION TREES; MAPS;

FORESTRY;

EID: 84885583821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63238-7_39     Document Type: Conference Paper

References (19)

1. Aref, W., Samet, H.: Optimization Strategies for Spatial Query Processing. Proceedings of the VLDB Conference. (1991) 81-90.
2. *-Tree: An Efficient and Robust Method for Points and Rectangles. Proceedings of the ACM SIGMOD Conference. (1990) 322-331.
3. Bentley, J.: Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM. 18(9) (1975) 509-517.
4. Faloutsos, C., Kamel, I.: Beyond Uniformity and Independence: Analysis of R-Trees using the Concept of Fractal Dimension. Proceedings of the ACM PODS Conference. (1994) 4-19.
5. Faloutsos, C., Roseman, S.: Fractals for Secondary Key Retrieval. Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). (1989) 247-252.
6. Gargantini, I.: An Effective Way to Represent Quad Trees. Communications of the ACM. 25(12) (1982) 905-910.
7. Gunther, O., Bilmes, J.: Tree Based Access Methods for Spatial Databases: Implementation and Performance Evaluation. IEEE Transactions on Knowledge and Data Engineering. 3(3) (1991) 342-356.
8. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the ACM SIGMOD Conference. (1984) 47-57.
9. Hinrichs, K., Nievergelt, J.: The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects. Proceedings of the WG'83. (1983) 100-113.
10. Jagadish, H.: Linear Clustering of Objects with Multiple Attributes. Proceedings of the ACM SIGMOD Conference. (1990) 332-342.
11. Kamel, I., Faloutsos, C.: Hubert R-Tree: An Improved R-tree using fractals. Proceedings of the 20th VLDB conference. (1994)
12. Kamel, I., Faloutsos, C.: On Packing R-Trees. Proceedings of the 2nd International Conference on Information and Knowledge Management. 490-499.
13. Knuth, D.: The Art of Computer Programming, Vol. 3: Sorting and Searching. (1973).
14. Lomet, D., Salzberg, B.: The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. ACM TODS. (1990) 15(4) 625-658.
15. Orenstein, J.: Spatial Query Processing in an Object-oriented Database System. Proceedings of the ACM SIGMOD Conference. (1986) 326-336.
16. Robinson, J.: The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proceedings of the ACM SIGMOD Conference. (1981) 10-18.
17. Roussopoulos, N., Leifker, D.: Direct Spatial Search on Pictorial Databases using Packed R-Trees. Proceedings of the ACM SIGMOD Conference. (1985)
18. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison Wesley. (1989)
19. Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+ tree: A Dynamic Index Structure for Multi-Dimensional Objects. Proceedings of the 13th International Conference on VLDB. (1987) 507-518.