Level 5 of 13 · about 2 weeks
Indexing
Why an unindexed query must scan everything, B+-trees and hash indexes, LSM-trees for write-heavy workloads, composite and covering indexes, bloom filters and bitmap indices, when an index actually hurts, and reading an execution plan to check any of it.
Modules
Core: everyone needs it. Common: most jobs use it. Specialist: optional depth, safe to skip on a first read.
1
The anatomy of an index
why an unindexed query must scan everything, and what an index changes about that
Core 5 parts · about 2 hours
2
B+-trees in depth
the ordered, self-balancing structure behind most database indexes, and how it grows
Core 5 parts · about 3 hours
3
Hash indexes
trading away order for raw exact-match speed, and knowing when that trade backfires
Common 5 parts · about 2 hours
4
LSM-trees and SSTables
write-optimized storage for workloads where B+-trees start to strain
Common 5 parts · about 2 hours
5
Composite and covering indexes
indexing more than one column, and why column order changes everything
Core 5 parts · about 2 hours
6
Bloom filters and bitmap indices
a probabilistic shortcut for "definitely not here," and a compact structure for low-cardinality columns
Specialist 5 parts · about 2 hours
7
When indexes hurt
every index helps some queries and costs every write, so more is not always better
Core 5 parts · about 2 hours
8
Reading an execution plan
how to see, in concrete terms, whether a query actually used an index
Core 5 parts · about 2 hours