Tom Lane 14c7fba3f7 Rethink original decision to use AND/OR Expr nodes to represent bitmap ... logic operations during planning. Seems cleaner to create two new Path node types, instead --- this avoids duplication of cost-estimation code. Also, create an enable_bitmapscan GUC parameter to control use of bitmap plans.		2005-04-21 19:18:13 +00:00
..
bitmapset.h	Some more missed copyright notices. Many of these look like they	2005-01-01 20:44:34 +00:00
execnodes.h	Minor performance improvement: avoid unnecessary creation/unioning of	2005-04-20 15:48:36 +00:00
makefuncs.h	Merge Resdom nodes into TargetEntry nodes to simplify code and save a	2005-04-06 16:34:07 +00:00
memnodes.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
nodeFuncs.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
nodes.h	Rethink original decision to use AND/OR Expr nodes to represent bitmap	2005-04-21 19:18:13 +00:00
params.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
parsenodes.h	Add a "USING" clause to DELETE, which is equivalent to the FROM clause	2005-04-07 01:51:41 +00:00
pg_list.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
plannodes.h	Create executor and planner-backend support for decoupled heap and index	2005-04-19 22:35:18 +00:00
primnodes.h	Merge Resdom nodes into TargetEntry nodes to simplify code and save a	2005-04-06 16:34:07 +00:00
print.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
readfuncs.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
relation.h	Rethink original decision to use AND/OR Expr nodes to represent bitmap	2005-04-21 19:18:13 +00:00
tidbitmap.h	Initial implementation of lossy-tuple-bitmap data structures.	2005-04-17 22:24:02 +00:00
value.h	Some more missed copyright notices. Many of these look like they	2005-01-01 20:44:34 +00:00