Vivcre Learn
- Database
Why an Index Turns 200,000 Reads Into 4
How a database physically finds a row, why un-indexed lookups scale linearly, and how a B-tree collapses that to a handful of page reads.
- Database
Compaction: The Triangle You Can't Escape
Size-tiered vs leveled compaction, and why every LSM engine must pay one of read, write, or space amplification.
- Database
How LSM Trees Make Writes Cheap
Why write-heavy databases buffer in memory and merge sorted files on disk.