
Log-Structured Merge-Trees abandon random, in-place mutations for sequential, append-only writes. Data is buffered in memory, then flushed to disk as immutable, sorted string tables that are periodically compacted in the background. History is never overwritten, only merged and superseded by newer entries. The append replaces the edit.