NIST

B+-tree

(data structure)

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

Generalization (I am a kind of ...)
B-tree.

Author: PEB

Implementation

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 E. Black.

Entry modified Wed Sep 8 14:12:25 2004.
HTML page formatted Wed Oct 26 09:47:17 2005.

Cite this as:
Paul E. Black, "B+-tree", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/bplustree.html

to NIST home page