Database Indexing (B+ Tree) Simulator
Visualizing Heap pages, Buffer Pool Cache, and Scan cost tradeoffs.
t = 0.0s
-
Fit
+
Start
Step
Reset
Speed
0.25x
0.5x
1x
2x
5x
Seed
−
Fit
+
Tree is healthy
internal node
leaf node
heap page
active/lookup particle