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}
}
  • J. Bentley
  • Published 1 September 1975
  • 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… 

Figures from this paper

Multidimensional search trees that provide new types of memory reductions
TLDR
An orthogonal query that asks to aggregate the set of records in k-dimensional box regions is studied, and it is shown that space O(log log N) makes possible a combined time complexity for retrievals, insertions, and deletions.
K-d trees for semidynamic point sets
TLDR
Other new techniques can be applied to general K-d trees, leading to a data structure that is significantly faster and less vulnerable to pathological inputs than ordinary <italic>K—d trees.
Distance browsing in spatial databases
TLDR
The incremental nearest neighbor algorithm significantly outperforms the existing k-nearest neighbor algorithm for distance browsing queries in a spatial database that uses the R-tree as a spatial index and it is proved informally that at any step in its execution the incremental nearest neighbors algorithm is optimal with respect to the spatial data structure that is employed.
Cache-oblivious data structures for orthogonal range searching
TLDR
A dynamic linear-size data structure that answers d-dimensional queries in O((N/B) 1-1/d</sup>+T/B)</i> memory transfers, where <i>B</i> is the block size of any two levels of a multilevel memory hierarchy.
Towards Logarithmic Search Time Complexity for R-Trees
TLDR
It is proved that a logarithmic search complexity can be achieved for two dimensions, if the form of nodes is optimized relative to theform of search conditions.
PANENE: A Progressive Algorithm for Indexing and Querying Approximate k-Nearest Neighbors
TLDR
PANENE operations can be bounded in time, allowing analysts to access running results within an interactive latency, and incrementally build and maintain a cache data structure, a KNN lookup table, to enable constant-time lookups for KNN queries.
Adding range restriction capability to dynamic data structures
TLDR
A transformation is presented that enables range restrictions to be added to an arbitrary dynamic data structure on n elements, provided that the problem satisfies a certain decomposability condition and that one is willing to allow increases by a factor of O in the worst-case time for an operation and in the space used.
Rank Selection in Multidimensional Data
TLDR
This work develops a simple algorithm that adds to an existing data structure (K-d trees) the capability of search by rank with very little overhead and can be easily adapted to other spatial indexes as well.
Randomized K-Dimensional Binary Search Trees
TLDR
It is shown that several types of associative queries are efficiently supported by randomized Kd-trees, a variant of K-dimensional binary search trees that allows the efficient maintenance of multidimensional records for any sequence of insertions and deletions and thus, is fully dynamic.
Multikey retrieval from K-d trees and QUAD-trees
TLDR
An experiment compares the retrieval performance of K-d trees, quad-trees, and flat files, as measured by CPU time, wall clock time, and I/O operations and suggests that there is no one best type of file structure for all types of assoclatlve queries.
...
...

References

SHOWING 1-10 OF 13 REFERENCES
An Algorithm for Finding Best Matches in Logarithmic Expected Time
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.
Time Bounds for Selection
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Quad trees: a data structure for retrieval on composite key." Acta lnformatica
  • 1974
The Art of Computer Programmhtg, Vol. 1li: Sorting and Searching
  • 1973
An algorithm for finding best matches in logarithmic time
  • Stanford CS Rep .
The Art of Computer Programmhtg Sorting and Searching
  • The Art of Computer Programmhtg Sorting and Searching
  • 1973
Computer Science 144A midterm examination, spring quarter
  • Computer Science 144A midterm examination, spring quarter
  • 1973
An algorithm for finding best matches in logarithmic time
  • Stanford CS Rep .
...
...