Tom Lane ce6e31de9c Teach the planner to treat a partial unique index as proving a variable is ... unique for a particular query, if the index predicate is satisfied. This requires a bit of reordering of operations so that we check the predicates before doing any selectivity estimates, but shouldn't really cause any noticeable slowdown. Per a comment from Michal Politowski.		2009-02-15 20:16:21 +00:00
..
clauses.c	Arrange for function default arguments to be processed properly in expressions	2009-01-09 15:46:11 +00:00
joininfo.c	Update copyright for 2009.	2009-01-01 17:24:05 +00:00
Makefile	Add a concept of "placeholder" variables to the planner. These are variables	2008-10-21 20:42:53 +00:00
pathnode.c	Update copyright for 2009.	2009-01-01 17:24:05 +00:00
placeholder.c	Update copyright for 2009.	2009-01-01 17:24:05 +00:00
plancat.c	Teach the planner to treat a partial unique index as proving a variable is	2009-02-15 20:16:21 +00:00
predtest.c	Arrange for function default arguments to be processed properly in expressions	2009-01-09 15:46:11 +00:00
relnode.c	Update copyright for 2009.	2009-01-01 17:24:05 +00:00
restrictinfo.c	Fix cost_mergejoin's failure to adjust for rescanning of non-unique merge join	2009-02-06 23:43:24 +00:00
tlist.c	Update copyright for 2009.	2009-01-01 17:24:05 +00:00
var.c	Update copyright for 2009.	2009-01-01 17:24:05 +00:00