Tom Lane a4ca842319 Fix a bunch of bad interactions between partial indexes and the new ...

planning logic for bitmap indexscans.  Partial indexes create corner
cases in which a scan might be done with no explicit index qual conditions,
and the code wasn't handling those cases nicely.  Also be a little
tenser about eliminating redundant clauses in the generated plan.
Per report from Dmitry Karasik.

2005-07-28 20:26:22 +00:00

..

bitmapset.h

Marginal hack to avoid spending a lot of time in find_join_rel during

2005-06-08 23:02:05 +00:00

execnodes.h

Add Oracle-compatible GREATEST and LEAST functions. Pavel Stehule

2005-06-26 22:05:42 +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

Replace pg_shadow and pg_group by new role-capable catalogs pg_authid

2005-06-28 05:09:14 +00:00

params.h

Tag appropriate files for rc3

2004-12-31 22:04:05 +00:00

parsenodes.h

Add a role property 'rolinherit' which, when false, denotes that the role

2005-07-26 16:38:29 +00:00

pg_list.h

Fix a bunch of bad interactions between partial indexes and the new

2005-07-28 20:26:22 +00:00

plannodes.h

Remove support for OR'd indexscans internal to a single IndexScan plan

2005-04-25 01:30:14 +00:00

primnodes.h

Add Oracle-compatible GREATEST and LEAST functions. Pavel Stehule

2005-06-26 22:05:42 +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

Simple constraint exclusion. For now, only child tables of inheritance

2005-07-23 21:05:48 +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