Status: IN
B-tree range scans provide correct ordered sequential access by walking the actively maintained sibling chain with support for unbounded end keys, traversing all matching keys in sorted order.
Sibling chain maintenance ensures ordering but no cycle detection means a corrupt pointer could cause infinite traversal
Depends on (SL): btree-sibling-chain-maintained-across-mutations, range-scan-supports-unbounded
Unless: range-scan-no-cycle-guard