pgsql: Reduce btree scan overhead for < and > strategies
pgsql: Reduce btree scan overhead for < and > strategies
От:
Simon Riggs <simon@2ndQuadrant.com>
Дата:
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 Branch ------ master Details ------- http://git.postgresql.org/pg/commitdiff/606c0123d627b37d5ac3f7c2c97cd715dde7842f Modified Files -------------- src/backend/access/nbtree/nbtsearch.c | 27 +++++++++++++++++++++++++++ src/backend/access/nbtree/nbtutils.c | 7 +++++++ src/include/access/nbtree.h | 1 + 3 files changed, 35 insertions(+)