Tom Lane 596efd27ed Optimize multi-batch hash joins when the outer relation has a nonuniform ... distribution, by creating a special fast path for the (first few) most common values of the outer relation. Tuples having hashvalues matching the MCVs are effectively forced to be in the first batch, so that we never write them out to the batch temp files. Bryce Cutt and Ramon Lawrence, with some editorialization by me.		2009-03-21 00:04:40 +00:00
..
allpaths.c	Fix set_subquery_pathlist() to copy the RTE's subquery before it gets mangled	2009-03-10 20:58:26 +00:00
clausesel.c	Fix cost_mergejoin's failure to adjust for rescanning of non-unique merge join	2009-02-06 23:43:24 +00:00
costsize.c	Optimize multi-batch hash joins when the outer relation has a nonuniform	2009-03-21 00:04:40 +00:00
equivclass.c	Fix cost_mergejoin's failure to adjust for rescanning of non-unique merge join	2009-02-06 23:43:24 +00:00
indxpath.c	Improve match_special_index_operator() to recognize that LIKE with an	2009-03-11 03:32:22 +00:00
joinpath.c	Fix an old corner-case error in match_unsorted_outer(): don't consider	2009-02-05 01:24:55 +00:00
joinrels.c	Tighten up join ordering rules to account for recent more-careful analysis	2009-02-27 22:41:38 +00:00
Makefile	Refactor backend makefiles to remove lots of duplicate code	2008-02-19 10:30:09 +00:00
orindxpath.c	Teach the planner to treat a partial unique index as proving a variable is	2009-02-15 20:16:21 +00:00
pathkeys.c	Shave a few cycles in compare_pathkeys() by checking for pointer-identical	2009-02-28 03:51:05 +00:00
tidpath.c	Update copyright for 2009.	2009-01-01 17:24:05 +00:00