In a PostgreSQL B-tree, why does the executor, after positioning at the first matching leaf entry for a range scan, NOT need to consult the internal (branch) pages again to fetch subsequent matching tuples in the range?
SELECT id FROM t WHERE id BETWEEN 1000 AND 5000;