B-tree variants
B+-tree vs. B-tree
The concept of B-tree order* doesn't make sense in practice
- Even assuming fixed-length keys and values, B+-tree leaf nodes and internal
nodes would have different orders.
- Variable-length values (and sometimes keys) are extremely common.
- So the concept of a B-tree's order doesn't really work
for B+-trees.
records per node.)
- Key compression means that even keys are variable-length.
* A B-tree of order d stores between d and 2d keys.
|