Why Database Storage Engines Use LSM Trees
from Database Tech with Fexingo: SQL, NoSQL, and Data Storage Conversations Hosted by Fexingo
Episode 161 of Database Tech with Fexingo breaks down the LSM tree, the storage structure behind many modern databases. Lucas and Luna explain why write-heavy workloads struggle with traditional B-trees, how LSM trees turn random writes into sequential ones, and the price they pay in read performance. Using the example of a ride-hailing company's trip log, they walk through memtables, SSTables, compaction, and the role of bloom filters. They discuss real-world trade-offs, when to choose LSM over B-tree, and why some databases even mix both. If you've ever wondered how databases handle millions of writes per second without falling over, this episode gives you the concrete mechanics and a practical mental model. #LSMTree #DatabaseStorage #WriteOptimization #Memtable #SSTable #Compaction #BloomFilter #BTreeVsLSM #RideHailingData #WriteHeavyWorkloads #DatabaseInternals #StorageEngines #DataEngineering #SQL #NoSQL #Technology #FexingoBusiness #BusinessPodcast Keep every episode free: buymeacoffee.com/fexingo
Embed this episode
No transcript yet.