Amit Kapila 956891faba Update parallel BTree scan state when the scan keys can't be satisfied. ...

For parallel btree scan to work for array of scan keys, it should reach
BTPARALLEL_DONE state once for every distinct combination of array keys.
This is required to ensure that the parallel workers don't try to seize
blocks at the same time for different scan keys. We missed to update this
state when we discovered that the scan keys can't be satisfied.

Author: James Hunter
Reviewed-by: Amit Kapila
Tested-by: Justin Pryzby
Backpatch-through: 10, where it was introduced
Discussion: https://postgr.es/m/4248CABC-25E3-4809-B4D0-128E1BAABC3C@amazon.com

2020-09-17 15:53:25 +05:30

..

brin

BRIN: Handle concurrent desummarization properly

2020-08-12 15:33:36 -04:00

common

Force tuple conversion when the source has missing attributes.

2020-02-05 20:15:13 +00:00

gin

Fix code for re-finding scan position in a multicolumn GIN index.

2020-08-27 17:36:13 -04:00

gist

Fix buffile.c error handling.

2020-06-16 17:00:37 +12:00

hash

During the split, set checksum on an empty hash index page.

2018-09-04 08:33:33 +05:30

heap

Handle new HOT chains in index-build table scans

2020-08-13 17:33:49 -04:00

index

Further cleanup of client dependencies on src/include/catalog headers.

2018-04-09 14:39:58 -04:00

nbtree

Update parallel BTree scan state when the scan keys can't be satisfied.

2020-09-17 15:53:25 +05:30

rmgrdesc

Revert "Skip WAL for new relfilenodes, under wal_level=minimal."

2020-03-22 09:24:13 -07:00

spgist

Fix masking of SP-GiST pages during xlog consistency check

2020-06-20 17:35:59 +03:00

tablesample

Update copyright for 2018

2018-01-02 23:30:12 -05:00

transam

Prevent concurrent SimpleLruTruncate() for any given SLRU.

2020-08-15 10:15:57 -07:00

Makefile

TABLESAMPLE, SQL Standard and extensible

2015-05-15 14:37:10 -04:00