Next: 5.5 To Probe Further
Up: 5.4 B-Trees
Previous: 5.4.4 B-Trees: Deletion
- Internal nodes contain the indices to the records corresponding to the
k1, k2,..., km stored at the internal node. This obviates
the need for repeating these key values and associated indices at the leaf
- More efficient than B-Trees in the case of successful searches.
- The minimum number of children at each internal node (except the root) is
- Pathlengths are smaller for obvious reasons
- Insertions and deletions are more complex.