B+ Tree
Like B-Tree, except
- record pointers are only in the leaves
- left-side pointer has keys <= rather than <
- leaf nodes are linked together left to right
Allows sequential access of entire file!
Interior nodes have higher order than leaf nodes
- Fewer non-leaf levels than B-Tree