Multidimensional Binary Search Trees in Database Applications

DOI10.1109/TSE.1979.234200zbMath0411.68055OpenAlexW2067021215MaRDI QIDQ4198073

Jon Louis Bentley

Publication date: 1979

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1979.234200

zbMATH Keywords

data structuresdatabasesmultidimensional binary search treesmultikey searching, partial match query, range query

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (12)

Fast \(k\)-nearest-neighbor search based on projection and triangular inequality ⋮ KpyrRec: a recursive multidimensional indexing structure ⋮ A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves ⋮ Optimal choice of discriminators in a balanced K-D binary search tree ⋮ Divided \(k-d\) trees ⋮ Improvement of the \(k\)-means clustering filtering algorithm ⋮ The properties of random trees ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems ⋮ An improved algorithm for the maximum agreement subtree problem ⋮ Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. ⋮ Secondary attribute retrieval using tree data structures ⋮ Multidimensional bisection: A dual viewpoint

This page was built for publication: Multidimensional Binary Search Trees in Database Applications