FAST database writes with LSM (Log-Structured Merge trees)
Ben Dicken · 15:02 · Watch on YouTube
An LSM-tree database makes ingest cheap by writing each row into an in-memory memtable, recording it in a write-ahead log, and later flushing full memtables as large sequential disk chunks. Reads pay for that: a looku...