A balanced tree that speeds equal and range lookups.

A Postgres index lives to answer a query

An index is valuable because it changes the work needed by a real query. Counting indexed columns is not a useful success measure. A narrow B-tree that finds one customer’s newest three orders can outperform a wider structure that cannot supply the needed ordering, while a query reading almost every row may correctly ignore both. Evaluate access, ordering, and result volume together. ...

July 20, 2027 · 4 min · XB Field Notes