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
Composite Index Column Order: Equality First, Range Last
Why the column order in a multi-column index decides whether the planner can use it, and the equality-first, range-last rule that follows from how the index is sorted.
- Database
Covering Indexes and the Index-Only Scan
How an index that contains every column a query needs answers it without ever touching the heap — and the MVCC caveat that quietly breaks the trick.
- Database
From Lost Updates to MVCC: Isolating Concurrent Transactions
How a naive concurrent counter loses updates, why pure locking creates a traffic jam, and how multi-version concurrency control lets readers and writers stop blocking each other.
- Database
MongoDB Data Modeling: Start From the Workload
Why MongoDB inverts relational modeling — shape the data around the queries — and how embed-vs-reference is the same read/write tradeoff you already know, one level up.
- Database
How LSM Trees Make Writes Cheap
Why write-heavy databases buffer in memory and merge sorted files on disk.