Abstract
The extendible cell method is an application of order preserving extendible hashing to multidimensional point files. We derive some of its performance characteristics and show its expected case optimality for closest point problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
J. L. Bentley and J. H. Friedman,A survey of algorithms and data structures for range searching, ACM Comp. Surv., Vol. 11, No. 4, 1979, 397–409.
J. L. Bentley and D. F. Stanat,Analysis of range searches in quad trees, Info. Proc. Lett., Vol. 3, No. 6, 1975, 170–173.
J. L. Bentley, B. W. Weide and A. C. Yao,Optimal expected-time algorithms for closest point problems, ACM TOMS, Vol. 6, No. 4, 1980, 563–579.
D. R. Cox and P. A. W. Lewis,The Statistical Analysis of Series of Events, Methuen, London, 1966.
R. Fagin, J. Nievergelt, N. Pippenger and H. R. Strong,Extendible hashing — a fast access method for dynamic files, ACM TODS, 3, 1979, 315–344.
J. H. Friedman, J. L. Bentley and A. Finkel,An algorithm for finding best matches in logarithmic expected time, ACM TOMS, Vol. 6, No. 4, 1977, 209–226.
D. E. Knuth,The Art of Computer Programming, vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.
D. T. Lee and C. K. Wong,Worst case analysis of region and partial region searches in multidimensional binary search trees and quad trees, Acta Inf., 9, 1, 1978, 23–29.
G. Nagy and S. Wagle,Geographic data processing, ACM Comp. Surv., Vol. 11, No. 2, 1979, 139–181.
J. A. Orenstein,Multidimensional tries used for associative searching, School of Computer Science, Mc Gill University, 1981.
J. T. Robinson,The K-D-B-tree: a search structure for large multidimensional dynamic indexes, ACM-SIGMOD conference proceedings, Y. E. Lien, ed., 1981.
J. B. Saxe and J. L. Bentley,Transforming static data structures to dynamic structures, Report CMU-CS-79-141, Carnegie-Mellon University, 1979.
M. Tamminen,The extendible cell method for fast geometric access, Report HTKK-TKO-A20, Helsinki University of Technology, Espoo, 1980.
M. Tamminen,A general description of the EXCELL method, Report HTKK-TKO-B22, Helsinki University of Technology, Espoo, 1980.
M. Tamminen,A note on order preserving extendible hashing and bucket tries, BIT 21, 1981, 419–435.
M. Tamminen,Efficient spatial access to a data base, Report-HTKK-TKO-B27, Helsinki University of Technology, Espoo, 1981.
M. Tamminen,Expected performance of some cell based file organization schemes, Report-HTKK-B28, Helsinki University of Technology, Espoo, 1981.
M. Tamminen,Hidden lines using the EXCELL method, Report-HTKK-TKO-B34, Helsinki University of Technology, Espoo, 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tamminen, M. The extendible cell method for closest point problems. BIT 22, 27–41 (1982). https://doi.org/10.1007/BF01934393
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01934393