Gregory Stark <stark@enterprisedb.com> writes:
> That means going to the index meta page, find the fast root pointer, look up
> that page, look at the single leaf page pointer, look up that page, and do a
> binary search of the 200 leaf pointers. Once you find the resulting match,
> look up the heap page and *then* go directly to the right tuple.
Actually, the metapage access has been cached for some time, and there's
not going to be a separate root page if you only have 1 page worth of
index entries. But yeah, for large indexes there are going to be
multiple page accesses before you find what you want.
regards, tom lane
