B-Tree Concepts
Each node contains
- tree (index node) pointers, and
- key values (with record or page pointers)
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
“Order p” means (up to) p tree pointers, (up to) p-1 keys
- Terminology differs between authors