Acta Informatica

, Volume 9, Issue 1, pp 23–29

Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

  • D. T. Lee
  • C. K. Wong
Article

DOI: 10.1007/BF00263763

Cite this article as:
Lee, D.T. & Wong, C.K. Acta Informatica (1977) 9: 23. doi:10.1007/BF00263763

Summary

Given a file of N records each of which has k keys, the worst-case analysis for the region and partial region queries in multidimensional binary search trees and balanced quad trees are presented. It is shown that the search algorithms proposed in [1, 3] run in time O(k·N1−1/k) for region queries in both tree structures. For partial region queries with s keys specified, the search algorithms run at most in time O(s·N1−1/k) in both structures.

Copyright information

© Springer-Verlag 1977

Authors and Affiliations

  • D. T. Lee
    • 1
  • C. K. Wong
    • 2
  1. 1.Department of Computer Science and the Coordinated Science LaboratoryUniversity of IllinoisUrbana-ChampaignUSA
  2. 2.IBM Thomas J. Watson Research CenterYorktown HeightsUSA