B+ Tree vs. B-tree
Textbook only discusses B+ trees
Two big differences:
- Original B-trees had record pointers in all of the index nodes; B+ trees only in leaf nodes
Given a key K and the two node pointers L and R around it
- All key values pointed to by L are < K
- All key values pointed to by R are >= K
- B+ tree data pages are linked together to form a sequential file
Gives the advantages of ISAM
In our book, it’s a doubly-linked list