Multidimensional Binary Search Trees Used for Associative Searching

@article{Bentley1975MultidimensionalBS,
  title={Multidimensional Binary Search Trees Used for Associative Searching},
  author={Jon Louis Bentley},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={509-517}
}
This paper develops the multidimensional binary search tree (or <italic>k</italic>-d tree, where <italic>k</italic> is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The <italic>k</italic>-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… CONTINUE READING
Highly Influential
This paper has highly influenced 301 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 5,378 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 3,001 extracted citations

5,379 Citations

0200400'76'86'97'08'19
Citations per Year
Semantic Scholar estimates that this publication has 5,379 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…