Multidimensional Binary Search Trees in Database Applications

DOI10.1109/TSE.1979.234200MaRDI QIDQ4198073zbMATH OpenOpenAlexFDO

Authors Jon 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

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

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198073)