Multidimensional binary search trees used for associative searching

@article{Bentley1975MultidimensionalBS,
  title={Multidimensional binary search trees used for associative searching},
  author={J. Bentley},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={509-517}
}
  • J. Bentley
  • Published 1975
  • Mathematics, Computer Science
  • Commun. ACM
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… Expand
6,246 Citations
Multidimensional search trees that provide new types of memory reductions
  • 13
K-d trees for semidynamic point sets
  • J. Bentley
  • Mathematics, Computer Science
  • SCG '90
  • 1990
  • 388
Distance browsing in spatial databases
  • 966
  • PDF
Cache-oblivious data structures for orthogonal range searching
  • 39
  • Highly Influenced
  • PDF
Towards Logarithmic Search Time Complexity for R-Trees
  • 5
PANENE: A Progressive Algorithm for Indexing and Querying Approximate k-Nearest Neighbors
  • 10
  • PDF
Adding range restriction capability to dynamic data structures
  • 190
Rank Selection in Multidimensional Data
  • 2
  • PDF
Randomized K-Dimensional Binary Search Trees
  • 40
Searching a two key table under a single key
  • 8
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Quad trees: a data structure for retrieval on composite key." Acta lnformatica
  • 1974
The Art of Computer Programmhtg, Vol. 1li: Sorting and Searching
  • 1973