Tom Lane af95d7aa63 Improve INTERSECT/EXCEPT hashing by realizing that we don't need to make any ... hashtable entries for tuples that are found only in the second input: they can never contribute to the output. Furthermore, this implies that the planner should endeavor to put first the smaller (in number of groups) input relation for an INTERSECT. Implement that, and upgrade prepunion's estimation of the number of rows returned by setops so that there's some amount of sanity in the estimate of which one is smaller.		2008-08-07 19:35:02 +00:00
..
Makefile	Refactor backend makefiles to remove lots of duplicate code	2008-02-19 10:30:09 +00:00
clauses.c	Teach the system how to use hashing for UNION. (INTERSECT/EXCEPT will follow,	2008-08-07 01:11:52 +00:00
joininfo.c	Update copyrights in source tree to 2008.	2008-01-01 19:46:01 +00:00
pathnode.c	Teach the system how to use hashing for UNION. (INTERSECT/EXCEPT will follow,	2008-08-07 01:11:52 +00:00
plancat.c	Clean up the use of some page-header-access macros: principally, use	2008-07-13 20:45:47 +00:00
predtest.c	Fix logical errors in constraint exclusion: we cannot assume that a CHECK	2008-01-12 00:11:39 +00:00
relnode.c	Update copyrights in source tree to 2008.	2008-01-01 19:46:01 +00:00
restrictinfo.c	Update copyrights in source tree to 2008.	2008-01-01 19:46:01 +00:00
tlist.c	Improve INTERSECT/EXCEPT hashing by realizing that we don't need to make any	2008-08-07 19:35:02 +00:00
var.c	Restructure some header files a bit, in particular heapam.h, by removing some	2008-05-12 00:00:54 +00:00