Simon Riggs 606c0123d6 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		2014-11-18 10:24:55 +00:00
..
brin	BRIN: fix bug in xlog backup block counting	2014-11-10 18:13:49 -03:00
common	Rename pending_list_cleanup_size to gin_pending_list_limit.	2014-11-13 12:14:48 +09:00
gin	Rename pending_list_cleanup_size to gin_pending_list_limit.	2014-11-13 12:14:48 +09:00
gist	Remove obsolete cases from GiST update redo code.	2014-11-07 15:13:02 +02:00
hash	Fix race condition between hot standby and restoring a full-page image.	2014-11-13 20:02:37 +02:00
heap	Fix race condition between hot standby and restoring a full-page image.	2014-11-13 20:02:37 +02:00
index	Split builtins.h to a new header ruleutils.h	2014-10-08 18:10:47 -03:00
nbtree	Reduce btree scan overhead for < and > strategies	2014-11-18 10:24:55 +00:00
rmgrdesc	Fix some coding issues in BRIN	2014-11-08 00:31:03 -03:00
spgist	Fix generation of SP-GiST vacuum WAL records.	2014-11-07 21:17:46 +02:00
transam	Ensure unlogged tables are reset even if crash recovery errors out.	2014-11-15 01:19:26 +01:00
Makefile	BRIN: Block Range Indexes	2014-11-07 16:38:14 -03:00