A lookup reads few pages
A tree of height 2 needs 2 index pages and 1 heap page for a single key.
task
Make the query below touch at most 5 buffers.
Run a query to see rows here.
Run EXPLAIN on the statement under the cursor: Plan tab, button Explain.
No tables yet.
A tree of height 2 needs 2 index pages and 1 heap page for a single key.
Make the query below touch at most 5 buffers.