B-tree indices are similar to B -tree indices.
- Difference is that B-tree eliminates the redundant storage of search
- In B -tree of Figure 11.11, some search key values appear twice.
- A corresponding B-tree of Figure 11.18 allows search key values to
appear only once.
- Thus we can store the index in less space.
Figure 11.8: Leaf and nonleaf node of a B-tree.