B*-tree

(data structure)

Definition: A B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes.

See also B⁺-tree.

Author: PEB

More information

See links at B-tree.

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 6 November 2007.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Paul E. Black, "B*-tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 6 November 2007. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/bstartree.html