Virgin B-Tree vs Chad LSM

The Virgin B⁺-Tree uses locks and latches for nodes rewrites whole page on each update has single file writes to random places on disk large write-amplification unpredictable latency difficult to maintain The Chad LSM lock-free incredible write-throughput constantly compacts his stuff stores as much files as he wants uses bloom-filters immutable on-disk structures optimized for modern flash-based SSDs OUCH!

A side-by-side Virgin-versus-Chad comparison contrasts a B⁺-tree with an LSM tree. The awkward, burdened Virgin B⁺-tree suffers from locks, random writes, write amplification, and maintenance problems, while the confident Chad LSM is lock-free, optimized for flash storage, and constantly compacts data. The joke is a humorous pro-LSM reaction used in database and software-engineering discussions. EN: A side-by-side Virgin-versus-Chad comparison contrasts a B⁺-tree with an LSM tree. The awkward, burdened Virgin B⁺-tree suffers from locks, random writes, write amplification, and maintenance problems, while the confident Chad LSM is lock-free, optimized for flash storage, and constantly compacts data. The joke is a humorous pro-LSM reaction used in database and software-engineering discussions.

• @profunctor_io / 5699 2020-10-30