mirror of
https://github.com/postgres/postgres.git
synced 2025-07-07 00:36:50 +03:00
Assorted preparatory refactoring for partition-wise join.
Instead of duplicating the logic to search for a matching ParamPathInfo in multiple places, factor it out into a separate function. Pass only the relevant bits of the PartitionKey to partition_bounds_equal instead of the whole thing, because partition-wise join will want to call this without having a PartitionKey available. Adjust allow_star_schema_join and calc_nestloop_required_outer to take relevant Relids rather than the entire Path, because partition-wise join will want to call it with the top-parent relids to determine whether a child join is allowable. Ashutosh Bapat. Review and testing of the larger patch set of which this is a part by Amit Langote, Rajkumar Raghuwanshi, Rafia Sabih, Thomas Munro, Dilip Kumar, and me. Discussion: http://postgr.es/m/CA+TgmobQK80vtXjAsPZWWXd7c8u13G86gmuLupN+uUJjA+i4nA@mail.gmail.com
This commit is contained in:
@ -318,18 +318,15 @@ add_paths_to_joinrel(PlannerInfo *root,
|
||||
*/
|
||||
static inline bool
|
||||
allow_star_schema_join(PlannerInfo *root,
|
||||
Path *outer_path,
|
||||
Path *inner_path)
|
||||
Relids outerrelids,
|
||||
Relids inner_paramrels)
|
||||
{
|
||||
Relids innerparams = PATH_REQ_OUTER(inner_path);
|
||||
Relids outerrelids = outer_path->parent->relids;
|
||||
|
||||
/*
|
||||
* It's a star-schema case if the outer rel provides some but not all of
|
||||
* the inner rel's parameterization.
|
||||
*/
|
||||
return (bms_overlap(innerparams, outerrelids) &&
|
||||
bms_nonempty_difference(innerparams, outerrelids));
|
||||
return (bms_overlap(inner_paramrels, outerrelids) &&
|
||||
bms_nonempty_difference(inner_paramrels, outerrelids));
|
||||
}
|
||||
|
||||
/*
|
||||
@ -348,6 +345,12 @@ try_nestloop_path(PlannerInfo *root,
|
||||
{
|
||||
Relids required_outer;
|
||||
JoinCostWorkspace workspace;
|
||||
RelOptInfo *innerrel = inner_path->parent;
|
||||
RelOptInfo *outerrel = outer_path->parent;
|
||||
Relids innerrelids = innerrel->relids;
|
||||
Relids outerrelids = outerrel->relids;
|
||||
Relids inner_paramrels = PATH_REQ_OUTER(inner_path);
|
||||
Relids outer_paramrels = PATH_REQ_OUTER(outer_path);
|
||||
|
||||
/*
|
||||
* Check to see if proposed path is still parameterized, and reject if the
|
||||
@ -356,14 +359,12 @@ try_nestloop_path(PlannerInfo *root,
|
||||
* doesn't like the look of it, which could only happen if the nestloop is
|
||||
* still parameterized.
|
||||
*/
|
||||
required_outer = calc_nestloop_required_outer(outer_path,
|
||||
inner_path);
|
||||
required_outer = calc_nestloop_required_outer(outerrelids, outer_paramrels,
|
||||
innerrelids, inner_paramrels);
|
||||
if (required_outer &&
|
||||
((!bms_overlap(required_outer, extra->param_source_rels) &&
|
||||
!allow_star_schema_join(root, outer_path, inner_path)) ||
|
||||
have_dangerous_phv(root,
|
||||
outer_path->parent->relids,
|
||||
PATH_REQ_OUTER(inner_path))))
|
||||
!allow_star_schema_join(root, outerrelids, inner_paramrels)) ||
|
||||
have_dangerous_phv(root, outerrelids, inner_paramrels)))
|
||||
{
|
||||
/* Waste no memory when we reject a path here */
|
||||
bms_free(required_outer);
|
||||
|
@ -1993,14 +1993,15 @@ create_foreignscan_path(PlannerInfo *root, RelOptInfo *rel,
|
||||
* Note: result must not share storage with either input
|
||||
*/
|
||||
Relids
|
||||
calc_nestloop_required_outer(Path *outer_path, Path *inner_path)
|
||||
calc_nestloop_required_outer(Relids outerrelids,
|
||||
Relids outer_paramrels,
|
||||
Relids innerrelids,
|
||||
Relids inner_paramrels)
|
||||
{
|
||||
Relids outer_paramrels = PATH_REQ_OUTER(outer_path);
|
||||
Relids inner_paramrels = PATH_REQ_OUTER(inner_path);
|
||||
Relids required_outer;
|
||||
|
||||
/* inner_path can require rels from outer path, but not vice versa */
|
||||
Assert(!bms_overlap(outer_paramrels, inner_path->parent->relids));
|
||||
Assert(!bms_overlap(outer_paramrels, innerrelids));
|
||||
/* easy case if inner path is not parameterized */
|
||||
if (!inner_paramrels)
|
||||
return bms_copy(outer_paramrels);
|
||||
@ -2008,7 +2009,7 @@ calc_nestloop_required_outer(Path *outer_path, Path *inner_path)
|
||||
required_outer = bms_union(outer_paramrels, inner_paramrels);
|
||||
/* ... and remove any mention of now-satisfied outer rels */
|
||||
required_outer = bms_del_members(required_outer,
|
||||
outer_path->parent->relids);
|
||||
outerrelids);
|
||||
/* maintain invariant that required_outer is exactly NULL if empty */
|
||||
if (bms_is_empty(required_outer))
|
||||
{
|
||||
|
@ -1048,12 +1048,8 @@ get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel,
|
||||
Assert(!bms_overlap(baserel->relids, required_outer));
|
||||
|
||||
/* If we already have a PPI for this parameterization, just return it */
|
||||
foreach(lc, baserel->ppilist)
|
||||
{
|
||||
ppi = (ParamPathInfo *) lfirst(lc);
|
||||
if (bms_equal(ppi->ppi_req_outer, required_outer))
|
||||
return ppi;
|
||||
}
|
||||
if ((ppi = find_param_path_info(baserel, required_outer)))
|
||||
return ppi;
|
||||
|
||||
/*
|
||||
* Identify all joinclauses that are movable to this base rel given this
|
||||
@ -1290,12 +1286,8 @@ get_joinrel_parampathinfo(PlannerInfo *root, RelOptInfo *joinrel,
|
||||
*restrict_clauses = list_concat(pclauses, *restrict_clauses);
|
||||
|
||||
/* If we already have a PPI for this parameterization, just return it */
|
||||
foreach(lc, joinrel->ppilist)
|
||||
{
|
||||
ppi = (ParamPathInfo *) lfirst(lc);
|
||||
if (bms_equal(ppi->ppi_req_outer, required_outer))
|
||||
return ppi;
|
||||
}
|
||||
if ((ppi = find_param_path_info(joinrel, required_outer)))
|
||||
return ppi;
|
||||
|
||||
/* Estimate the number of rows returned by the parameterized join */
|
||||
rows = get_parameterized_joinrel_size(root, joinrel,
|
||||
@ -1334,7 +1326,6 @@ ParamPathInfo *
|
||||
get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
|
||||
{
|
||||
ParamPathInfo *ppi;
|
||||
ListCell *lc;
|
||||
|
||||
/* Unparameterized paths have no ParamPathInfo */
|
||||
if (bms_is_empty(required_outer))
|
||||
@ -1343,12 +1334,8 @@ get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
|
||||
Assert(!bms_overlap(appendrel->relids, required_outer));
|
||||
|
||||
/* If we already have a PPI for this parameterization, just return it */
|
||||
foreach(lc, appendrel->ppilist)
|
||||
{
|
||||
ppi = (ParamPathInfo *) lfirst(lc);
|
||||
if (bms_equal(ppi->ppi_req_outer, required_outer))
|
||||
return ppi;
|
||||
}
|
||||
if ((ppi = find_param_path_info(appendrel, required_outer)))
|
||||
return ppi;
|
||||
|
||||
/* Else build the ParamPathInfo */
|
||||
ppi = makeNode(ParamPathInfo);
|
||||
@ -1359,3 +1346,23 @@ get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
|
||||
|
||||
return ppi;
|
||||
}
|
||||
|
||||
/*
|
||||
* Returns a ParamPathInfo for the parameterization given by required_outer, if
|
||||
* already available in the given rel. Returns NULL otherwise.
|
||||
*/
|
||||
ParamPathInfo *
|
||||
find_param_path_info(RelOptInfo *rel, Relids required_outer)
|
||||
{
|
||||
ListCell *lc;
|
||||
|
||||
foreach(lc, rel->ppilist)
|
||||
{
|
||||
ParamPathInfo *ppi = (ParamPathInfo *) lfirst(lc);
|
||||
|
||||
if (bms_equal(ppi->ppi_req_outer, required_outer))
|
||||
return ppi;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
Reference in New Issue
Block a user