Abstract
This paper develops the multidimensional binary search tree (or k -d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k -d tree is defined and examples are given. It is shown to be quite efficient in its storage requirements. A significant advantage of this structure is that a single data structure can handle many types of queries very efficiently. Various utility algorithms are developed; their proven average running times in an n record file are: insertion, O (log n ); deletion of the root, O ( n ( k -1)/ k ); deletion of a random node, O (log n ); and optimization (guarantees logarithmic performance of searches), O ( n log n ). Search algorithms are given for partial match queries with t keys specified [proven maximum running time of O ( n ( k - t )/ k )] and for nearest neighbor queries [empirically observed average running time of O (log n ).] These performances far surpass the best currently known algorithms for these tasks. An algorithm is presented to handle any general intersection query. The main focus of this paper is theoretical. It is felt, however, that k -d trees could be quite useful in many applications, and examples of potential uses are given.
References
7
Referenced
5,098
- Friedman J.H. Bentley J.L. and Finkel R.A. An algorithm for finding best matches in logarithmic time. Stanford CS Rep. 75--482. Friedman J.H. Bentley J.L. and Finkel R.A. An algorithm for finding best matches in logarithmic time. Stanford CS Rep. 75--482.
- Blum M. Floyd R.W. Pratt V. Rivest R.L. and Tarjan R.E. Time bounds for selection. Stanford CS Rep. 73-349. Blum M. Floyd R.W. Pratt V. Rivest R.L. and Tarjan R.E. Time bounds for selection. Stanford CS Rep. 73-349.
10.1007/BF00288933- Knuth , D.E. The Art of Computer Programming , Vol. 1 : Fundamental Algorithms . Addison-Wesley , Reading, Mass ., 1969 . Knuth, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1969. / Fundamental Algorithms by Knuth D.E. (1969)
- Knuth , D.E. The Art of Computer Programmhtg, Vol. 1li: Sorting and Searching. Addison-Wesley, Reading , Mass. , 1973 . Knuth, D.E. The Art of Computer Programmhtg, Vol. 1li: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973. / Mass. by Knuth D.E. (1973)
- McCreight , E. Computer Science 144A midterm examination, spring quarter , 1973 . Stanford University . McCreight, E. Computer Science 144A midterm examination, spring quarter, 1973. Stanford University. / Computer Science 144A midterm examination, spring quarter by McCreight E. (1973)
- Rivest R.L. Analysis of associative retrieval algorithms. Stanford CS Rep. 74--415. Rivest R.L. Analysis of associative retrieval algorithms. Stanford CS Rep. 74--415.
Dates
| Type | When |
|---|---|
| Created | 23 years ago (July 27, 2002, 7:34 a.m.) |
| Deposited | 2 months ago (June 17, 2025, 12:38 p.m.) |
| Indexed | 59 minutes ago (Aug. 22, 2025, 12:45 a.m.) |
| Issued | 49 years, 11 months ago (Sept. 1, 1975) |
| Published | 49 years, 11 months ago (Sept. 1, 1975) |
| Published Online | 49 years, 11 months ago (Sept. 1, 1975) |
| Published Print | 49 years, 11 months ago (Sept. 1, 1975) |
@article{Bentley_1975, title={Multidimensional binary search trees used for associative searching}, volume={18}, ISSN={1557-7317}, url={http://dx.doi.org/10.1145/361002.361007}, DOI={10.1145/361002.361007}, number={9}, journal={Communications of the ACM}, publisher={Association for Computing Machinery (ACM)}, author={Bentley, Jon Louis}, year={1975}, month=sep, pages={509–517} }