Spatial searching in geometric databases
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 126, 496-503
- https://doi.org/10.1109/icde.1988.105496
Abstract
A principle is presented for transforming suitable index structures for points into index structures for k-dimensional intervals. In many applications, these intervals serve as simple geometric keys for nonzero-size objects. The transformation fully preserves the advantages of the selected index structure for points, such as efficient update and retrieval operations, especially range queries, as well as high storage space utilization. The authors have implemented an index structure for rectangles based on the grid file. A performance evaluation with geographic data shows highly encouraging results.Keywords
This publication has 9 references indexed in Scilit:
- Multidimensional order preserving linear hashing with partial expansionsPublished by Springer Nature ,1986
- Hintergrundspeicherstrukturen für ausgedehnte ObjekteInformatik-Fachberichte, 1986
- Datenbanksysteme für die Verwaltung Geometrischer ObjekteInformatik-Fachberichte, 1986
- Balanced multidimensional extendible hash treePublished by Association for Computing Machinery (ACM) ,1985
- Recursive linear hashingACM Transactions on Database Systems, 1984
- The Grid FileACM Transactions on Database Systems, 1984
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- Interpolation-based index maintenanceBIT Numerical Mathematics, 1983
- The K-D-B-treePublished by Association for Computing Machinery (ACM) ,1981