{"id":"range-scan-follows-sibling-chain","text":"`range_scan` walks the leaf-level linked list via `next_sibling` pointers rather than re-descending the tree, giving O(height + leaf pages in range) page reads.","truth_value":"IN","source":"entries/2026/05/28/b-tree-storage-engine-btree-range_scan.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"range-scan-follows-sibling-chain","truth_value":"IN","reason":"premise"}]}}