From c7111d11b188bd631a63c98e9aab8532176007c3 Mon Sep 17 00:00:00 2001 From: Simon Riggs Date: Thu, 3 Mar 2016 09:53:43 +0000 Subject: Revert buggy optimization of index scans 606c0123d627 attempted to reduce cost of index scans using > and < strategies, though got that completely wrong in a few complex cases. Revert whole patch until we find a safe optimization. --- src/backend/access/nbtree/nbtutils.c | 7 ------- 1 file changed, 7 deletions(-) (limited to 'src/backend/access/nbtree/nbtutils.c') diff --git a/src/backend/access/nbtree/nbtutils.c b/src/backend/access/nbtree/nbtutils.c index c850b4804fe..b714b2c2fb6 100644 --- a/src/backend/access/nbtree/nbtutils.c +++ b/src/backend/access/nbtree/nbtutils.c @@ -1429,13 +1429,6 @@ _bt_checkkeys(IndexScanDesc scan, bool isNull; Datum test; - /* - * If the scan key has already matched we can skip this key, as long - * as the index tuple does not contain NULL values. - */ - if (key->sk_flags & SK_BT_MATCHED && !IndexTupleHasNulls(tuple)) - continue; - /* row-comparison keys need special processing */ if (key->sk_flags & SK_ROW_HEADER) { -- cgit v1.2.3