B-Tree Observations
Delete algorithm merges adjacent nodes < 50% full, but rarely used in practice
Root and most level-1 nodes are cached, to reduce disk accesses
Secondary (non-clustered) index - Leaves contain [key, record id] pairs.
Primary (clustered) index - Leaves contain records
Use key prefix for long (string) key values
- drop prefix and add to suffix as you move down the tree