Tom Lane 1a77f8b63d Avoid scanning nulls at the beginning of a btree index scan. ... If we have an inequality key that constrains the other end of the index, it doesn't directly help us in doing the initial positioning ... but it does imply a NOT NULL constraint on the index column. If the index stores nulls at this end, we can use the implied NOT NULL condition for initial positioning, just as if it had been stated explicitly. This avoids wasting time when there are a lot of nulls in the column. This is the reverse of the examples given in bugs #6278 and #6283, which were about failing to stop early when we encounter nulls at the end of the indexscan.		2011-11-02 19:35:48 -04:00
..
common	Buffering GiST index build algorithm.	2011-09-08 17:51:23 +03:00
gin	Clean up the #include mess a little.	2011-09-04 01:13:16 -04:00
gist	Clean up a couple of box gist helper functions.	2011-10-09 18:59:34 +03:00
hash	Measure the number of all-visible pages for use in index-only scan costing.	2011-10-14 17:23:46 -04:00
heap	Fix race condition with toast table access from a stale syscache entry.	2011-11-01 19:49:58 -04:00
index	Avoid assuming that index-only scan data matches the index's rowtype.	2011-10-16 19:15:04 -04:00
nbtree	Avoid scanning nulls at the beginning of a btree index scan.	2011-11-02 19:35:48 -04:00
transam	Update more comments about checkpoints being done by bgwriter	2011-11-02 17:15:35 +00:00
Makefile	Remove cvs keywords from all files.	2010-09-20 22:08:53 +02:00