|< < 29 > >|

The B-tree

Structure

• A B-tree node (except for the root) has m keys, d ≤ m ≤ 2d. d is the order order of the tree.

• The root has m keys, 1 ≤ m ≤ 2d keys.

• An internal node with m keys has m+1 children.

|< < 29 > >|