(data structure)
Definition: A conceptual idea which generalizes B-trees to multiple dimensions. BV-trees are not balanced, and searching may require backtracking.
Note: After [GG98].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:49:01 2004.
HTML page formatted Wed Oct 26 09:47:18 2005.
Cite this as:
Paul E. Black, "BV-tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bvtree.html
