summaryrefslogtreecommitdiff
path: root/src/backend/access/gist/gist.c
diff options
context:
space:
mode:
authorSimon Riggs <simon@2ndQuadrant.com>2014-11-18 10:24:55 +0000
committerSimon Riggs <simon@2ndQuadrant.com>2014-11-18 10:24:55 +0000
commit606c0123d627b37d5ac3f7c2c97cd715dde7842f (patch)
treed7afc6412732b75ada6c45581d59a4ee7abf487d /src/backend/access/gist/gist.c
parentdedae6c211415290cdf5faca4ef874f803af204c (diff)
downloadpostgresql-606c0123d627b37d5ac3f7c2c97cd715dde7842f.tar.gz
Reduce btree scan overhead for < and > strategies
For <, <=, > and >= strategies, mark the first scan key as already matched if scanning in an appropriate direction. If index tuple contains no nulls we can skip the first re-check for each tuple. Author: Rajeev Rastogi Reviewer: Haribabu Kommi Rework of the code and comments by Simon Riggs
Diffstat (limited to 'src/backend/access/gist/gist.c')
0 files changed, 0 insertions, 0 deletions