B-Trees: Addressing the problems of Paged Trees and Multi-Level Indexing
Trees appear to be a good general solution to indexing, but each particular solution we’ve looked at so far presents some problems.
Paged Trees suffer from the fact that they are built downward from the top and that a “bad” root may unbalance the construct.
Multi-Level Indexing takes a different approach that solves many problems but creates costly insertion and deletion.
An ideal solution would be one that combines the advantages of the previous solutions and does not suffer from their disadvantages.
B-Trees appear to do just that!