Indexes: how databases actually find things fast
The B-tree explained from scratch, why it gives O(log n) lookups, and when adding an index makes things worse, not better.
13 min readUpdated 2026-09-04database-designindexesb-treeperformance
The B-tree explained from scratch, why it gives O(log n) lookups, and when adding an index makes things worse, not better.