📚 LSM Tree vs B-Tree
Direct comparison of LSM trees and B-trees: write vs. read trade-offs, memory usage, amplification costs, and ideal workload fit — with diagrams of both data paths.
Direct comparison of LSM trees and B-trees: write vs. read trade-offs, memory usage, amplification costs, and ideal workload fit — with diagrams of both data paths.
Deep dive into MemTables, flushing to SSTables, and why compaction is where the real costs lie. Includes the full lifecycle of a key, with cost analysis for insert, flush, and compaction steps.
Explains how fsync underpins the 'D' in ACID, why databases rely on it for WAL persistence, and the latency vs. safety trade-offs when tuning durability settings.