{"id":"hash-index-read-is-single-seek","text":"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)","truth_value":"IN","source":"entries/2026/05/29/topic-bitcask-vs-lsm-tree.md","source_url":"","source_hash":"","justifications":[],"dependents":["hash-index-is-memory-bound-by-design"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"hash-index-read-is-single-seek","truth_value":"IN","reason":"premise"}]}}