universal B-tree

(data structure)

Definition: (no definition here, yet, but you can help.)

Generalization (I am a kind of ...)
point access method, B-tree.

See also unlimited branching tree.

Note: "UB-tree" refers to this definition or unlimited branching tree.

More information

Rudolf Bayer, The Universal B-Tree for multidimensional Indexing, Technical Report TUM-I9637, November 1996. Access to PDF file.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 25 January 2010.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
"universal B-tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 25 January 2010. (accessed TODAY) Available from: