• Simon Riggs's avatar
    Reduce btree scan overhead for < and > strategies · 606c0123
    Simon Riggs authored
    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
    606c0123
nbtsearch.c 50.4 KB