Status: IN
A Bitcask `get()` does one dict lookup plus one positioned disk read (O(1)), while an LSM-tree `get()` may search the memtable then multiple SSTables from newest to oldest (O(log N) per level)
Source: entries/2026/05/29/topic-bitcask-vs-lsm-tree.md
JSON