|< < 23 > >|

B-tree variants

B+-tree vs. B-tree

So what replaces order in B+-tree algorithms?

• In a B-tree: Rebalance or merge internal nodes when the number of keys falls below d.

• In a B+-tree: Rebalance of merge when storage utilization falls below 50%.

|< < 23 > >|