Indexes (B-tree)senior🔒 Pro concept

B-tree on-disk anatomy: the metapage, the levels, and how a range scan moves

Simple terms

Picture the index as a stack of fixed-size pages. One page at the front is just a signpost: here is the top of the tree, and here is how tall it is. Everything in the middle is directions, pointers down to other pages. Only the bottom row holds real entries. Three kinds of page, and that is the whole structure. Those bottom pages are also chained left to right, which is the entire reason a range scan can walk sideways instead of climbing back up the tree for every row it wants.

You might be asked

Walk me through what a PostgreSQL B-tree index actually looks like on disk. What is in the metapage, how are the levels arranged, how does a range scan move across leaves, and what is the 'high key' for?

TopicIndex internals / B-tree on-disk structure
PostgreSQLPostgreSQL 12-17 (Lehman & Yao B-link tree, nbtree version 4)
Tools usedpgi17 (PostgreSQL 17.10), pageinspect (bt_metap / bt_page_stats / bt_page_items)
Last reviewed2026-06-19

Pro concept

Full answer and evidence depth sit behind Pro

You have the question and a plain-English lead. Pro unlocks the short answer, what the docs say, what the code does, the labeled lab evidence or reproduction protocol, how to use it under pressure, and the references.

ProFull answer + evidence depth

Unlock the full breakdown for B-tree on-disk anatomy: the metapage, the levels, and how a range scan moves

You have the interview question and a plain-English lead. Pro opens the short answer, the manual walkthrough, the source decode, and a 1-line evidence section that states whether it is raw output, a captured run summary, or a protocol to run yourself, plus how to use it under pressure.
  • How you'd answer it, the full senior-level short answer
  • What the docs say, the manual's actual wording, with the citations
  • What the code does, the mechanism decoded from PostgreSQL's own source at a pinned tag
  • Proof from a real run, labeled as raw output, a captured run summary, or a run-it-yourself protocol
  • Using it under pressure, the situation, the call you'd make, what goes wrong, and what people get wrong
  • Version notes, what changed across PostgreSQL releases

Card required. Cancel before day 7 and you are not charged.

Compare plans

How this was verified

The open teaser is the question and a plain-English lead. The short answer, the manual walkthrough, the source decode, the lab evidence, and how to use it under pressure unlock with Pro. Evidence is labeled as raw output, a captured run summary, or a run-it-yourself protocol.

Connected

Where this concept connects

How this concept links across the library, the interview questions that test it, its plain-English glossary definition, and the guided pathways it belongs to. Open the full map to explore further.

Open in the interactive map →