(data structure)

Definition: A B-tree in which keys are stored in the leaves.

Generalization (I am a kind of ...)

See also B*-tree.

Note: An early use of the name, "B+-tree", is Douglas Comer, The Ubiquitous B-Tree, Computing Surveys, 11(2):121-137, June 1979.

Author: PEB


Search the web for bplus to find implementations. More targeted searches are bplustree, "b plus tree", or search the comp.sources groups for bplus.
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 Wed Mar 13 12:42:45 2019.

Cite this as:
Paul E. Black, "B+-tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 November 2007. (accessed TODAY) Available from: