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.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 6 November 2007.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "B+-tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 6 November 2007. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/bplustree.html