lsm-newest-first-read-path

Status: IN

`get()` searches memtable, then immutable memtables, then SSTables in reverse-seq order (newest first), returning the first match; this guarantees newer writes shadow older ones without scanning all levels.

Source: entries/2026/05/28/log-structured-merge-tree-lsm.md

Example

if key in self._memtable:
    return self._memtable[key]  # check memtable first
for sst in reversed(self._sstables):  # newest SSTable first
    val = sst.get(key)
    if val is not None: return val

JSON