🚀 What Every Programmer Has to Know About Database Storage (Alex Petrov)

[@ZacharySmith89]

Some points: The RUM conjecture states that optimizing disk for these 3 is at odds: 1. read speed, 2. write speed, and 3. space use. B-trees are optimized for read speeds at the cost of write speeds. LSM trees are optimized for write speeds at the cost of read speeds.