mirror of
https://github.com/postgres/postgres.git
synced 2025-07-05 07:21:24 +03:00
Rework join-removal logic as per recent discussion. In particular this
fixes things so that it works for cases where nested removals are possible. The overhead of the optimization should be significantly less, as well.
This commit is contained in:
@ -8,7 +8,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $PostgreSQL: pgsql/src/backend/optimizer/util/pathnode.c,v 1.157 2010/02/26 02:00:47 momjian Exp $
|
||||
* $PostgreSQL: pgsql/src/backend/optimizer/util/pathnode.c,v 1.158 2010/03/28 22:59:33 tgl Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -1214,26 +1214,6 @@ distinct_col_search(int colno, List *colnos, List *opids)
|
||||
return InvalidOid;
|
||||
}
|
||||
|
||||
/*
|
||||
* create_noop_path
|
||||
* Creates a path equivalent to the input subpath, but having a different
|
||||
* parent rel. This is used when a join is found to be removable.
|
||||
*/
|
||||
NoOpPath *
|
||||
create_noop_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath)
|
||||
{
|
||||
NoOpPath *pathnode = makeNode(NoOpPath);
|
||||
|
||||
pathnode->path.pathtype = T_Join; /* by convention */
|
||||
pathnode->path.parent = rel;
|
||||
pathnode->path.startup_cost = subpath->startup_cost;
|
||||
pathnode->path.total_cost = subpath->total_cost;
|
||||
pathnode->path.pathkeys = subpath->pathkeys;
|
||||
pathnode->subpath = subpath;
|
||||
|
||||
return pathnode;
|
||||
}
|
||||
|
||||
/*
|
||||
* create_subqueryscan_path
|
||||
* Creates a path corresponding to a sequential scan of a subquery,
|
||||
|
Reference in New Issue
Block a user