Multidimensional Binary Search Trees in Database Applications

IEEE Transactions on Software Engineering

Volumn SE-5, Issue 4, 1979, Pages 333-340

  Bentley, Jon L ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Best match query binary trees data structures k d trees multikey searching partial match query range query; Index Terms

Indexed keywords

DATA BASE SYSTEMS;

DATA PROCESSING;

EID: 0018492535     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1979.234200     Document Type: Article

References (22)

1. Bentley, J. L. [1975], “Multidimensional binary search trees used for associative searching,” Commun. Ass. Comput. Mach., vol. 19, pp. 509–517, Sept. 1975.
2. Bentley, J. L. [1979], “Decomposable searching problems,” Inform. Process. Lett., to be published.
3. Bentley, J. L. and W. A. Burkhard [1976], “Heuristics for partial match retrieval data base design,” Inform. Process. Lett., vol. 4, pp. 132–135, Feb. 1976.
4. Bentley, J. L. and J. H. Friedman [1978a], “Fast algorithms for constructing minimal spanning trees in coordinate spaces,” IEEE Trans. Comput., vol. C-27, pp. 97–105, Feb. 1978.
5. Bentley, J. L. and J. H. Friedman [1978b], “Algorithms and data structures for range queries,” in Proc. Computer Science and Statistics: 11th Ann. Symp. on the Interface, Mar. 1978, pp. 297–307.
6. Bentley, J. L. and D. F. Stanat [1975], “Analysis of range searches in quad trees,” Inform. Process. Lett., vol. 3, pp. 170–173, July 1975.
7. Eastman, C. M. [1977], “A tree algorithm for nearest neighbor search in document retrieval systems,” unpublished Ph.D. dissertation, Univ. of North Carolina, Chapel Hill, NC, 111 pp.
8. Friedman, J. J., J. L. Bentley, and R. A. Finkel [1977], “An algorithm for finding best matches in logarithmic expected time,” ACM Trans. Mathematical Software, vol. 3, pp. 209–226, Sept. 1977.
9. Gotlieb, C. C. and L. R. Gotlieb [1978], Data Types and Structures. Englewood Cliffs, NJ: Prentice-Hall, pp. 357–363.
10. Knuth, D. E. [1973], The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley.
11. Lauther, U. [1978], “4-dimensional binary search trees as a means to speed up associative searches in design rule verification of integrated circuits,” J. Design Automation and Fault-Tolerant Computing, vol. 2, pp. 241–247, July 1978.
12. Lee, D. T. and C. K. Wong [1977], “Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees,” Acta Informatica, vol. 9, pp. 23–29.
13. Lin, W. C., R. C. T. Lee, and H. C. Du [1976], “Towards a unifying theory for multi-key file systems,” National Tsing-Hua University, Taiwan, Republic of China, Rep., 67 pp.
14. Rivest, R. L. [1976], “Partial match retrieval algorithms,” SIAM J. Comput. vol. 5, pp. 19–50, Mar. 1976.
15. Silva-Filho, Y. V. [1978a], “Average case analysis of region search in balanced k-d trees,” University of Kent, Canterbury, Rep., 16 pp, Nov. 1978.
16. Silva-Filho, Y. V. [1978b], “Multidimensional search trees as indices of files,” University of Kent, Canterbury, Rep., 6 pp, Dec. 1978.
17. Weide, B. W. [1978], “Space-efficient online selection algorithms,” in Proc. Computer Science and Statistics: 11th Annu. Symp. on the Interface, Mar. 1978, 308–311.
18. Wiederhold, G. [1977], Database Design. New York: McGraw-Hill, chs. 3 and 4.
19. Willard, D. E. [1978], “Balanced forests of k-d* trees as a dynamic data structure,” Harvard Univ., informative abstract, 29 pp, 1978.
20. Williams, Jr., E. H., A. Vaughn, B. McLaughlin, and M. Buchanan [1975], “PABST program logic manual,” Univ. of North Carolina, Chapel Hill, NC, unpublished class project.
21. Woodford, B. [1977], “An investigation of some new tree structures,” M.Sc. project, McMaster Univ., Hamilton, Ont., viii + 36 pp, Aug. 1977.
22. Zolnowsky, J. E. [1978], “Topics in computational geometry,” Ph.D. dissertation, Stanford Univ., Stanford, CA; also Stanford Comput. Sci. Rep. STAN-CS-78-659 and Stanford Linear Accelerator Center Rep. SLAC-206, 53 pp.