Affiliation:
1. Imperial College, London, UK
2. Humboldt-Univ. zu Berlin, Berlin, Germany
Abstract
Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the
point query
(find all objects that contain a given search point) and the
region query
(find all objects that overlap a given search region). More than ten years of spatial database research have resulted in a great variety of multidimensional access methods to support such operations. We give an overview of that work. After a brief survey of spatial data management in general, we first present the class of
point access methods
, which are used to search sets of points in two or more dimensions. The second part of the paper is devoted to
spatial access methods
to handle extended objects, such as rectangles or polyhedra. We conclude with a discussion of theoretical and experimental results concerning the relative performance of various approaches.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference193 articles.
1. A comparative analysis of some two-dimensional orderings;ABEL D. J.;Int. J. Geograph. Inf. Syst.,1990
2. A data structure and algorithm based on a linear key for a rectangle retrieval problem;ABEL D. J.;Comput. Vis.,1983
3. Organization and maintenance of large ordered indices;BAYER R.;Acta Inf.,1972
Cited by
809 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献