Multidimensional Binary Search Trees in Database Applications
Abstract
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.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The KD Tree is able to retrieve key information in multidimensional space.
“The KD Tree is able to retrieve the key information in the multidimensional space [11].”
From Digital Image Copyright Protection and Management Approach—Based on Artificial Intelligence and Blockchain Technology (2025) · cites this paper as [11]
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,097 · see citing works
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,659 · see citing works
Self-citationAn Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,802 · see citing works
Self-citationThe Art of Computer Programming, Vol. 3: Sorting and Searching
McClellan, M. T., Minker, J., & Knuth, D. E. (1974) · Mathematics of Computation · doi:10.2307/2005383 · Cited by 914 · see citing works
Decomposable searching problems
Bentley, J. L. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90117-0 · Cited by 343 · see citing works
Self-citationWiederhold, G. C. M. (1977) · Cited by 317 · see citing works
Partial-Match Retrieval Algorithms
Rivest, R. L. (1976) · SIAM Journal on Computing · doi:10.1137/0205003 · Cited by 244 · see citing works
Lee, D. T., & Wong, C. K. (1977) · Acta Informatica · doi:10.1007/bf00263763 · Cited by 222 · see citing works
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
Bentley, J. L., & Friedman (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675043 · Cited by 119 · see citing works
Self-citationAnalysis of range searches in quad trees
Bently, J. L., & Stanat, D. F. (1975) · Information Processing Letters · doi:10.1016/0020-0190(75)90034-4 · Cited by 73 · see citing works
Average case analysis of region search in balanced k-d trees
Silva-Filho, Y. V. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90110-8 · Cited by 20 · see citing works
Heuristics for partial-match retrieval data base design
Bentley, J. L., & Burkhard, W. A. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90027-2 · Cited by 19 · see citing works
Self-citationTopics in Computational Geometry
Zolnowsky, J. (2018) · doi:10.2172/1453953 · Cited by 14 · see citing works
Balanced Forests of K-D* Trees as a Dynamic Data Structure.
Willard, D. E. (1978) · Defense Technical Information Center (DTIC) · Cited by 9 · see citing works
Lobianco, A. (2019) · Apress eBooks · doi:10.1007/978-1-4842-5190-4_2 · Cited by 6 · see citing works
An Investigation of Some New Tree Structures
Woodford, B. (1977) · MacSphere (McMaster University) · doi:10.71548/19507 · Cited by 1 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Xu, J., Zhang, J., & Wang, J. (2025) · Journal of Theoretical and Applied Electronic Commerce Research · doi:10.3390/jtaer20020076 · Cited by 9 · see citing works
“The KD Tree is able to retrieve the key information in the multidimensional space [11].”
- Authors
- Bentley, J. L.
- Affiliations
- Carnegie Mellon University (US)
- Corresponding author
- Bentley, J.L.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1979-07
- Volume
- SE-5
- Issue
- 4
- Pages
- 333-340
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2067021215
- Cited by
- 410
- References
- 16
- Citations by year
- 2026: 4 · 2025: 5 · 2024: 5 · 2023: 7 · 2022: 11 · 2021: 12 · 2020: 6 · 2019: 9 · 2018: 13 · 2017: 7 · 2016: 9 · 2015: 12 · 2014: 11 · 2013: 10 · 2012: 12
- FWCI
- 18.80
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Software Engineering (publishedVersion)
- Defense Technical Information Center (DTIC) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Data Management and Algorithms
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Keywords
- k-d tree, geometric data analysis, large databases, spatial indexing
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
