(data structure)
Definition: A point access method which splits multidimensional space in different dimensions at each level. It also keeps a minimum bounding box of points accessible by each node.
Note: After [GG98].
Author: PEB
Bernhard Seeger and Hans-Peter Kriegel, The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems, 16th International Conference on Very Large Data Bases (VLDB), pages 590-601, 1990.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:48:55 2004.
HTML page formatted Wed Oct 26 09:47:18 2005.
Cite this as:
Paul E. Black, "buddy tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/buddytree.html
