Tom Lane d7153c5fad Fix best_inner_indexscan to return both the cheapest-total-cost and ... cheapest-startup-cost innerjoin indexscans, and make joinpath.c consider both of these (when different) as the inside of a nestloop join. The original design was based on the assumption that indexscan paths always have negligible startup cost, and so total cost is the only important figure of merit; an assumption that's obviously broken by bitmap indexscans. This oversight could lead to choosing poor plans in cases where fast-start behavior is more important than total cost, such as LIMIT and IN queries. 8.1-vintage brain fade exposed by an example from Chuck D.		2007-05-22 01:40:33 +00:00
..
bitmapset.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
execnodes.h	Teach tuplestore.c to throw away data before the "mark" point when the caller	2007-05-21 17:57:35 +00:00
makefuncs.h	Fix up the remaining places where the expression node structure would lose	2007-03-17 00:11:05 +00:00
memnodes.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
nodeFuncs.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
nodes.h	Rename the newly-added commands for discarding session state.	2007-04-26 16:13:15 +00:00
params.h	First phase of plan-invalidation project: create a plan cache management	2007-03-13 00:33:44 +00:00
parsenodes.h	Modify processing of DECLARE CURSOR and EXPLAIN so that they can resolve the	2007-04-27 22:05:49 +00:00
pg_list.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
plannodes.h	Modify processing of DECLARE CURSOR and EXPLAIN so that they can resolve the	2007-04-27 22:05:49 +00:00
primnodes.h	Fix array coercion expressions to ensure that the correct volatility is	2007-03-27 23:21:12 +00:00
print.h	Turn the rangetable used by the executor into a flat list, and avoid storing	2007-02-22 22:00:26 +00:00
readfuncs.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
relation.h	Fix best_inner_indexscan to return both the cheapest-total-cost and	2007-05-22 01:40:33 +00:00
tidbitmap.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
value.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00