This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multidimensional Binary Search Trees in Database Applications
July 1979 (vol. 5 no. 4)
pp. 333-340
J.L. Bentley, Departments of Computer Science and Mathematics, Carnegie-Mellon University
The multidimensional binary search tree (abbreviated k-d tree) is a data structure for storing multikey records. This structure has been used to solve a number of "geometric" problems in statistics and data analysis. The purposes of this paper are to cast k-d trees in a database framework, to collect the results on k-d trees that have appeared since the structure was introduced, and to show how the basic data structure can be modified to facilitate implementation in large (and very large) databases.
Index Terms:
range query, Best match query, binary trees, data structures, k-d trees, multikey searching, partial match query
Citation:
J.L. Bentley, "Multidimensional Binary Search Trees in Database Applications," IEEE Transactions on Software Engineering, vol. 5, no. 4, pp. 333-340, July 1979, doi:10.1109/TSE.1979.234200
Usage of this product signifies your acceptance of the Terms of Use.