| layout | post | |
|---|---|---|
| title | B tree vs. B+ tree | |
| date | 2018-07-22 11:54 | |
| comments | true | |
| categories | system design | |
| language | en | |
| references |
Pros of B tree
- Data associated with each key ⟶ frequently accessed nodes can lie closer to the root, and therefore can be accessed more quickly.
Pros of B+ tree
- No data associated in the interior nodes ⟶ more keys in memory ⟶ fewer cache misses
- Leaf nodes of B+ trees are linked ⟶ easier to traverse ⟶ fewer cache misses
