projects / users / rhaas / postgres.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 772d0f9) | patch
Improve btree's initial-positioning-strategy code so that we never need
authorTom Lane <tgl@sss.pgh.pa.us>
Sun, 21 Dec 2003 01:23:06 +0000 (01:23 +0000)
committerTom Lane <tgl@sss.pgh.pa.us>
Sun, 21 Dec 2003 01:23:06 +0000 (01:23 +0000)
commit569659ae16f4e4f3585ec4197f1017db53d184ef
tree0be6fb9762eeae3c5039ee2292bc37b95994f04ctree
parent772d0f9345adc32c401ec9098083a4ffc0ff4603commit | diff
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.
src/backend/access/nbtree/nbtinsert.c diff | blob | blame | history
src/backend/access/nbtree/nbtpage.c diff | blob | blame | history
src/backend/access/nbtree/nbtsearch.c diff | blob | blame | history
src/include/access/nbtree.h diff | blob | blame | history
Robert Haas's development tree.