Improve btree's initial-positioning-strategy code so that we never need
Tom Lane <tgl@sss.pgh.pa.us>
Improve btree's initial-positioning-strategy code so that we never need to step more than one entry after descending the search tree to arrive at the correct place to start the scan. This can improve the behavior substantially when there are many entries equal to the chosen boundary value. Per suggestion from Dmitry Tkach, 14-Jul-03.
Files
| Path | Change | +/− |
|---|---|---|
| src/backend/access/nbtree/nbtinsert.c | modified | +6 −6 |
| src/backend/access/nbtree/nbtpage.c | modified | +2 −2 |
| src/backend/access/nbtree/nbtsearch.c | modified | +173 −116 |
| src/include/access/nbtree.h | modified | +6 −5 |