summaryrefslogtreecommitdiff
path: root/src/backend/access/nbtree/nbtutils.c
diff options
context:
space:
mode:
authorAlexander Korotkov <akorotkov@postgresql.org>2023-12-27 14:22:02 +0200
committerAlexander Korotkov <akorotkov@postgresql.org>2023-12-27 14:35:08 +0200
commit7e6fb5da41d8ee1bddcd5058b7204018ef68d193 (patch)
tree915e481c1049304294d5d1ed6881637565556d30 /src/backend/access/nbtree/nbtutils.c
parent06b10f80ba4db745f21847520b07b4ffad814313 (diff)
Improvements and fixes for e0b1ee17dc
e0b1ee17dc introduced optimization for matching B-tree scan keys required for the directional scan. However, it incorrectly assumed that all keys required for opposite direction scan are satisfied by _bt_first(). It has been illustrated that with multiple scan keys over the same column, a lesser one (according to the scan direction) could win leaving the other one unsatisfied. Instead of relying on _bt_first() this commit introduces code that memorizes whether there was at least one match on the page. If that's true we know that keys required for opposite-direction scan are satisfied as soon as corresponding values are not NULLs. Also, this commit simplifies the description for the optimization of keys required for the current direction scan. Now the flag used for this is named continuescanPrechecked and means exactly that *continuescan flag is known to be true for the last item on the page. Reported-by: Peter Geoghegan Discussion: https://postgr.es/m/CAH2-Wzn0LeLcb1PdBnK0xisz8NpHkxRrMr3NWJ%2BKOK-WZ%2BQtTQ%40mail.gmail.com Reviewed-by: Pavel Borisov
Diffstat (limited to 'src/backend/access/nbtree/nbtutils.c')
-rw-r--r--src/backend/access/nbtree/nbtutils.c40
1 files changed, 26 insertions, 14 deletions
diff --git a/src/backend/access/nbtree/nbtutils.c b/src/backend/access/nbtree/nbtutils.c
index f25d62b05a5..2b77936b1cb 100644
--- a/src/backend/access/nbtree/nbtutils.c
+++ b/src/backend/access/nbtree/nbtutils.c
@@ -1364,13 +1364,15 @@ _bt_mark_scankey_required(ScanKey skey)
* tupnatts: number of attributes in tupnatts (high key may be truncated)
* dir: direction we are scanning in
* continuescan: output parameter (will be set correctly in all cases)
- * requiredMatchedByPrecheck: indicates that scan keys required for
- * direction scan are already matched
+ * continuescanPrechecked: indicates that *continuescan flag is known to
+ * be true for the last item on the page
+ * haveFirstMatch: indicates that we already have at least one match
+ * in the current page
*/
bool
_bt_checkkeys(IndexScanDesc scan, IndexTuple tuple, int tupnatts,
ScanDirection dir, bool *continuescan,
- bool requiredMatchedByPrecheck)
+ bool continuescanPrechecked, bool haveFirstMatch)
{
TupleDesc tupdesc;
BTScanOpaque so;
@@ -1406,13 +1408,23 @@ _bt_checkkeys(IndexScanDesc scan, IndexTuple tuple, int tupnatts,
requiredOppositeDir = true;
/*
- * Is the key required for scanning for either forward or backward
- * direction? If so and caller told us that these types of keys are
- * known to be matched, skip the check. Except for the row keys,
- * where NULLs could be found in the middle of matching values.
+ * If the caller told us the *continuescan flag is known to be true
+ * for the last item on the page, then we know the keys required for
+ * the current direction scan should be matched. Otherwise, the
+ * *continuescan flag would be set for the current item and
+ * subsequently the last item on the page accordingly.
+ *
+ * If the key is required for the opposite direction scan, we can skip
+ * the check if the caller tells us there was already at least one
+ * matching item on the page. Also, we require the *continuescan flag
+ * to be true for the last item on the page to know there are no
+ * NULLs.
+ *
+ * Both cases above work except for the row keys, where NULLs could be
+ * found in the middle of matching values.
*/
- if ((requiredSameDir || requiredOppositeDir) &&
- !(key->sk_flags & SK_ROW_HEADER) && requiredMatchedByPrecheck)
+ if ((requiredSameDir || (requiredOppositeDir && haveFirstMatch)) &&
+ !(key->sk_flags & SK_ROW_HEADER) && continuescanPrechecked)
continue;
if (key->sk_attno > tupnatts)
@@ -1513,12 +1525,12 @@ _bt_checkkeys(IndexScanDesc scan, IndexTuple tuple, int tupnatts,
}
/*
- * Apply the key checking function. When the key is required for
- * opposite direction scan, it must be already satisfied by
- * _bt_first() except for the NULLs checking, which have already done
- * above.
+ * Apply the key-checking function. When the key is required for the
+ * opposite direction scan, it must be already satisfied as soon as
+ * there is already match on the page. Except for the NULLs checking,
+ * which have already done above.
*/
- if (!requiredOppositeDir)
+ if (!(requiredOppositeDir && haveFirstMatch))
{
test = FunctionCall2Coll(&key->sk_func, key->sk_collation,
datum, key->sk_argument);