(data structure)
Definition: (no definition here, yet, but you can help.)
Also known as universal B-tree.
Generalization (I am a kind of ...)
point access method, B-tree.
Rudolf Bayer, The Universal B-Tree for multidimensional Indexing, Technical Report TUM-I9637, November 1996. Access to PDF file.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 10:07:28 2006.
Cite this as:
"UB-tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/ubtree.html
