B+ Tree Index
The most common index structure in databases. Balanced tree optimized for disk access.
0:00
0% complete
LearnStep 1 of 2
B+ Tree
Learning Objectives
- •Understand B+ tree structure
- •Learn search and insert operations
Lesson Outline
LearnStep 1/2
B+ Tree
Properties
- All leaves at same depth (balanced)
- Internal nodes: Only keys, no data
- Leaf nodes: Keys + data pointers
- Leaves linked in sorted order
Search Operation
Range Query
sql
B+ Tree vs B-Tree
| B+ Tree | B-Tree |
|---|---|
| Data only in leaves | Data in all nodes |
| Leaves are linked | Leaves not linked |
| Better for range queries | May be faster for single lookup |
| More fan-out (keys per node) | Less fan-out |