Insertion into a B-Tree: General Strategy

• Search all the way down to the leaf level in order to find the insertion location.

• Insertion, overflow detection, and splitting on the upward path.

• Creation of a new root node if the current root was split.

Previous slide

Next slide

Back to first slide

View graphic version