Abstract
Geographic objects in two dimensional space are usually represented as points, lines, and regions. To retrieve these data objects from the database efficiently according to their spatial locations and spatial relationships, an efficient indexing mechanism is necessary. The kd-trees proposed in the literature are either unsuitable for indexing non-zero size objects such as line and region or require duplication of indexes. In this paper an alternative index structure called spatial kd-tree is proposed to facilitate the processing of queries concerning geographic information. The spatial kd-tree partitions a set of records on two dimensional space into small groups based on their spatial proximity. The structure not only provides efficient retrieval of objects but also maintains high storage efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bentley, J.L.Multidimensional Binary Search Trees Used for Associative Searching, Comm. of ACM, Vol. 18, No. 9, 1975, pp 509–517.
Bentley, J.L.Multidimensional Binary Search Trees in Database Application, IEEE Trans, on Soft. Eng., Vol. SE-5, No. 4, 1979(July), pp 333–340.
Bentley, J.L. and Friedman, J.H.Data Structures for Range Searching, Computing Survey, Vol. 11, No. 4, (Dec) 1979.
Chang, J.M. and Fu, K.S. Extended K-D Tree Database Organization: A Dynamic Multi-Attribute, Clustering Method”, IEEE Compsac, 1979, pp 39–43.
Finkel, R.A. and Bentley, J.L.Quad Trees: A Data Structure for Retrieval on Composite Keys, Acta Informatica 4, 1974, pp 1–9.
Friedman, J.H., Bentley, J.L., Finkel, R.A. An Algorithm for Finding Best Matches in Logarithmic Expected Time, Trans, on Math., Vol. 3, No. 3,pp 1978, pp 209–226
Guttman, A.R-Trees: A Dynamic Index Structure for Spatial Searching, SIGMOD 84, pp 47–57.
Knuth, D.E. Sorting and Searching in the series of The Art of Computer Programming, Vol 3 Addison Wesley, Reading 1973.
Kriegel, H.P. Variants of Multidimensional B-Trees as Dynamic Index Structure for Associative Retrieval in Database System, Proc. of the 8th Conf. on Graphtheoretic Concepts in Computer Science, Hanser Publishing Company, pp 110–128, 1982.
Matsuyama, T., Hao, L.V. and Nagao, M. A File Organization for Geographic Information Systems Based on Spatial Proximity, Computer Vision, Graphic, and Image Processing 26, 1984, pp 303–318.
Nievergelt, J., Hinterberger, H. and Sevcik, K.C.The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM Trans, on Database Systems, Vol. 9, No. 1, 1981, pp 38–71.
Ouksel, M. and Scheuermann, P. Multidimensional B-Trees: Analysis of Dynamic Behavior, BIT 1981, pp 401–418.
Robinson, J.T. The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes, SIGMOD, 1981, pp 10–18.
Sacks-Davis, R. and McDonell, K.J. GEOQL - A Query Language for Geographic Information Systems, Forthcoming Monash Technical Report, 1987.
Samet, H.The Quadtree and Related Hierarchical Data Structures, ACM Computing Survey, Vol. 16, No. 2, June 1984, pp 187–260.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ooi, B.C. (1987). Spatial kd-Tree: A Data Structure for Geographic Database. In: Schek, HJ., Schlageter, G. (eds) Datenbanksysteme in Büro, Technik und Wissenschaft. Informatik-Fachberichte, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72617-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-72617-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17736-4
Online ISBN: 978-3-642-72617-0
eBook Packages: Springer Book Archive