Interactive · runs in your browser
See the data structures databases run on
Four small simulators you can drive. Run a SQL query through a B-tree and a B+tree and watch the traversal node by node, or hand a latitude/longitude to a quad-tree and an R-tree and see which one finds you faster.
B-Tree →
Data lives in every node. Run a point lookup or a range scan and watch it walk — and bounce.
B+Tree →
Data only in the linked leaves. See why a range scan glides across the leaf chain in one sweep.
Quad-Tree →
Splits space on a fixed grid. Enter a latitude/longitude and watch it descend into the dense area.
R-Tree →
The balanced spatial index MySQL and PostGIS use. Same search, far fewer boxes opened.