LSM Log-Structured Merge-Tree

- Sequential access is better than random access -> WAL, append update to log

- Memstore in memory for quick lookup -> Memstore which flushes data to store file when reaches valve

- Merge multiple store files for improving read speed. -> minor compaction and major compaction

- Read performance -> Memstore -> store file (bloom filter for performance). Both Memstore and StoreFile have data structured in B plus tree for quick lookup.

Instead of updating data in random location, the random update is translated to sequential writes. Overwrite entire key-value pair in new file.