aboutsummaryrefslogtreecommitdiff
path: root/src/backend/utils/adt/misc.c
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2003-12-21 01:23:06 +0000
committerTom Lane <tgl@sss.pgh.pa.us>2003-12-21 01:23:06 +0000
commit569659ae16f4e4f3585ec4197f1017db53d184ef (patch)
tree0be6fb9762eeae3c5039ee2292bc37b95994f04c /src/backend/utils/adt/misc.c
parent772d0f9345adc32c401ec9098083a4ffc0ff4603 (diff)
downloadpostgresql-569659ae16f4e4f3585ec4197f1017db53d184ef.tar.gz
postgresql-569659ae16f4e4f3585ec4197f1017db53d184ef.zip
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.
Diffstat (limited to 'src/backend/utils/adt/misc.c')
0 files changed, 0 insertions, 0 deletions