R-trees: A dynamic index structure for spatial searching

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 1984, Pages 47-57

  Guttman, Antonin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DATABASE SYSTEMS; DECISION TREES;

DATA ITEMS; DATA OBJECTS; DYNAMIC INDICES; GEO-DATA; INDEXING METHODS; SPATIAL APPLICATIONS; SPATIAL DATA; SPATIAL LOCATION;

FORESTRY;

EID: 85031999247     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/602259.602266     Document Type: Conference Paper

References (16)

1. M. Astrahan, et al., System R: Relational Approach to Database Management, ACM Transactions on Database Systems 1, 2 (June 1976), 97-137.
2. R. Bayer and E. McCreight, Organization and Maintenance of Large Ordered Indices, Proc. 1970 ACM-SIGFIDET Workshop on Data Description and Access, Houston, Texas, Nov. 1970, 107-141.
3. J. L. Bentley, Multidimensional Binary Search Trees Used for Associative Searching, Communications of the ACM 18, 9 (September 1975), 509-517.
4. J. L. Bentley, D. F. Stanat and E. H. Williams Jr., The complexity of fixedradius near neighbor searching, Inf. Proc. Lett. 6, 6 (December 1977), 209- 212.
5. J. L. Bentley and J. H. Friedman, Data Structures for Range Searching, Computing Surveys 11, 4 (December 1979), 397-409.
6. D. Comer, The Ubiquitous B-tree, Computing Surveys 11, 2 (1979), 121- 138.
7. R. A. Finkel and J. L. Bentley, Quad Trees - A Data Structure for Retrieval on Composite Keys, Acta hformatica 4, (1974), 1-9.
8. A. Guttman and M. Stonebraker, Using a Relational Database Management System for Computer Aided Design Data, IEEE Database Engineering 5, 2 (June 1982).
9. G. Held, M. Stonebraker and E. Wong, INGRES - A Relational Data Base System Proc. AFIPS 1975 NCC 44, (1975), 409-416.
10. K. Hinrichs and J. Nievergelt, The Grid File: A Data Structure Designed to Support Proximity Queries on Spatial Objects, Nr. 54, Institut fur Informatik, Eidgenossische Technische Hochschule, Zurich, July 1983.
11. M. G. H. Katevenis, R. W. Sherburne, D. A. Patterson and C. H. Soquin, The RISC II Micro-Architecture, Proc. VLSI 83 Conference, Trondheim, Norway, August 1983.
12. J. K. Ousterhout, Comer Stitching: A Data Structuring Technique for VLSI Layout Tools, Computer Science Report Computer Science Dept. 82/114, University of California, Berkeley, 1982.
13. J. T. Robinson, The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes, 4CM-SIGMOD Conference Proc., April 1981, 10-18.
14. M. Stonebraker, B. Rubenstein and A. Guttman, Application of Abstract Data Types and Abstract Indices to CAD Data Bases, Memorandum No. UCE/ERL M83/3, Electronics Research Laboratory, University of California, Berkeley, January 1983.
15. K. C. Wong and M. Edelberg, Interval Hierarchies and Their Application to Predicate Files, ACM Transactions on Database Systems 2, 3 (September 1977), 223-232.
16. G. Yuval, Finding Near Neighbors in k-dimensional Space, Inf. Proc. Lett. 3, 4 (March 1975), 113-114.