{"id":"sstable-lookup-is-two-phase","text":"Point lookups in both SSTable implementations first binary-search the sparse index to identify a block, then linearly scan entries within that block's byte range; total cost is O(log(N/B) + B)","truth_value":"IN","source":"entries/2026/05/29/topic-sstable-block-format.md","source_url":"","source_hash":"","justifications":[],"dependents":["sstable-point-lookup-correct-under-sort-invariant"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sstable-lookup-is-two-phase","truth_value":"IN","reason":"premise"}]}}