← Back to Labs

B-tree Index Walk

Trace one lookup from root to leaf, then watch a split keep the index balanced when a page fills.

root: 20000 | 400000..1999920000..3999940000..MAXleaf keysleaf keysleaf keys
Step 1 / 4The root page narrows the search range

The database does not inspect every row. For `customer_id = 48291`, it first checks the root page to decide which broad key range can contain that value.

Example operation: customer_id = 48291

Arrow keys to navigate · R to reset

Tap dots to jump to any step

Read the full article →Take the quiz →