{"id":"btree-uses-bisect-not-linear-scan","text":"In-node key lookup uses `bisect_left`/`bisect_right` (binary search), making within-node search O(log B) rather than the textbook O(B) linear scan — shifting the optimal branching factor higher than classical B-tree analysis predicts.","truth_value":"IN","source":"entries/2026/05/29/topic-index-size-vs-scan-cost-benchmarking.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"btree-uses-bisect-not-linear-scan","truth_value":"IN","reason":"premise"}]}}