Tom Lane 604ffd280b Create hooks to let a loadable plugin monitor (or even replace) the planner ...

and/or create plans for hypothetical situations; in particular, investigate
plans that would be generated using hypothetical indexes.  This is a
heavily-rewritten version of the hooks proposed by Gurjeet Singh for his
Index Advisor project.  In this formulation, the index advisor can be
entirely a loadable module instead of requiring a significant part to be
in the core backend, and plans can be generated for hypothetical indexes
without requiring the creation and rolling-back of system catalog entries.

The index advisor patch as-submitted is not compatible with these hooks,
but it needs significant work anyway due to other 8.2-to-8.3 planner
changes.  With these hooks in the core backend, development of the advisor
can proceed as a pgfoundry project.

2007-05-25 17:54:25 +00:00

..

clauses.h

Get rid of some old and crufty global variables in the planner. When

2007-02-19 07:03:34 +00:00

cost.h

Teach tuplestore.c to throw away data before the "mark" point when the caller

2007-05-21 17:57:35 +00:00

geqo_copy.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo_gene.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo_misc.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo_mutation.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo_pool.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo_random.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo_recombination.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo_selection.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

geqo.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

joininfo.h

Refactor planner's pathkeys data structure to create a separate, explicit

2007-01-20 20:45:41 +00:00

pathnode.h

Refactor planner's pathkeys data structure to create a separate, explicit

2007-01-20 20:45:41 +00:00

paths.h

Fix best_inner_indexscan to return both the cheapest-total-cost and

2007-05-22 01:40:33 +00:00

plancat.h

Create hooks to let a loadable plugin monitor (or even replace) the planner

2007-05-25 17:54:25 +00:00

planmain.h

Teach tuplesort.c about "top N" sorting, in which only the first N tuples

2007-05-04 01:13:45 +00:00

planner.h

Create hooks to let a loadable plugin monitor (or even replace) the planner

2007-05-25 17:54:25 +00:00

predtest.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

prep.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

restrictinfo.h

Refactor planner's pathkeys data structure to create a separate, explicit

2007-01-20 20:45:41 +00:00

subselect.h

Get rid of some old and crufty global variables in the planner. When

2007-02-19 07:03:34 +00:00

tlist.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

var.h

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00