Spatial kd-Tree: A Data Structure for Geographic Database

  • Beng C. Ooi
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 136)


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.


kd-tree data structure associative search geographic database 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bent75]
    Bentley, J.L.Multidimensional Binary Search Trees Used for Associative Searching, Comm. of ACM, Vol. 18, No. 9, 1975, pp 509–517.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [Bent79]
    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.Google Scholar
  3. [BeFr79]
    Bentley, J.L. and Friedman, J.H.Data Structures for Range Searching, Computing Survey, Vol. 11, No. 4, (Dec) 1979.Google Scholar
  4. [ChFu79]
    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.Google Scholar
  5. [FiBe74]
    Finkel, R.A. and Bentley, J.L.Quad Trees: A Data Structure for Retrieval on Composite Keys, Acta Informatica 4, 1974, pp 1–9.CrossRefzbMATHGoogle Scholar
  6. [FBF78]
    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–226CrossRefGoogle Scholar
  7. [Gutt84]
    Guttman, A.R-Trees: A Dynamic Index Structure for Spatial Searching, SIGMOD 84, pp 47–57.Google Scholar
  8. [Knuth73]
    Knuth, D.E. Sorting and Searching in the series of The Art of Computer Programming, Vol 3 Addison Wesley, Reading 1973.Google Scholar
  9. [Krie82]
    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.Google Scholar
  10. [MHN84]
    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.CrossRefGoogle Scholar
  11. [NHS84]
    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.CrossRefGoogle Scholar
  12. [OuSc81]
    Ouksel, M. and Scheuermann, P. Multidimensional B-Trees: Analysis of Dynamic Behavior, BIT 1981, pp 401–418.Google Scholar
  13. [Rob81]
    Robinson, J.T. The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes, SIGMOD, 1981, pp 10–18.Google Scholar
  14. [SDMD87]
    Sacks-Davis, R. and McDonell, K.J. GEOQL - A Query Language for Geographic Information Systems, Forthcoming Monash Technical Report, 1987.Google Scholar
  15. [Sam84]
    Samet, H.The Quadtree and Related Hierarchical Data Structures, ACM Computing Survey, Vol. 16, No. 2, June 1984, pp 187–260.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Beng C. Ooi
    • 1
  1. 1.Department of Computer ScienceMonash UniversityClaytonAustralia

Personalised recommendations