Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Initial phase of support for constraint optimization to the PrestoDB optimizer in response to issue #16413 #16416

Merged
merged 3 commits into from
Jun 13, 2022
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -92,7 +92,13 @@
import com.facebook.presto.sql.planner.iterative.rule.PushTopNThroughUnion;
import com.facebook.presto.sql.planner.iterative.rule.RemoveEmptyDelete;
import com.facebook.presto.sql.planner.iterative.rule.RemoveFullSample;
import com.facebook.presto.sql.planner.iterative.rule.RemoveRedundantAggregateDistinct;
import com.facebook.presto.sql.planner.iterative.rule.RemoveRedundantDistinct;
import com.facebook.presto.sql.planner.iterative.rule.RemoveRedundantDistinctLimit;
import com.facebook.presto.sql.planner.iterative.rule.RemoveRedundantIdentityProjections;
import com.facebook.presto.sql.planner.iterative.rule.RemoveRedundantLimit;
import com.facebook.presto.sql.planner.iterative.rule.RemoveRedundantSort;
import com.facebook.presto.sql.planner.iterative.rule.RemoveRedundantTopN;
import com.facebook.presto.sql.planner.iterative.rule.RemoveTrivialFilters;
import com.facebook.presto.sql.planner.iterative.rule.RemoveUnreferencedScalarApplyNodes;
import com.facebook.presto.sql.planner.iterative.rule.RemoveUnreferencedScalarLateralNodes;
Expand Down Expand Up @@ -435,6 +441,12 @@ public PlanOptimizers(
estimatedExchangesCostCalculator,
Optional.of(new LogicalPropertiesProviderImpl(new FunctionResolution(metadata.getFunctionAndTypeManager()))),
ImmutableSet.of(
new RemoveRedundantDistinct(),
new RemoveRedundantTopN(),
new RemoveRedundantSort(),
new RemoveRedundantLimit(),
new RemoveRedundantDistinctLimit(),
new RemoveRedundantAggregateDistinct(),
new RemoveRedundantIdentityProjections(),
new PushAggregationThroughOuterJoin(metadata.getFunctionAndTypeManager()))),
inlineProjections,
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -33,17 +33,7 @@ public class MergeLimitWithDistinct

private static final Pattern<LimitNode> PATTERN = limit()
.with(source().matching(aggregation().capturedAs(CHILD)
.matching(MergeLimitWithDistinct::isDistinct)));

/**
* Whether this node corresponds to a DISTINCT operation in SQL
*/
private static boolean isDistinct(AggregationNode node)
{
return node.getAggregations().isEmpty() &&
node.getOutputVariables().size() == node.getGroupingKeys().size() &&
node.getOutputVariables().containsAll(node.getGroupingKeys());
}
.matching(AggregationNode::isDistinct)));

@Override
public Pattern<LimitNode> getPattern()
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,80 @@
/*
simmend marked this conversation as resolved.
Show resolved Hide resolved
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.facebook.presto.sql.planner.iterative.rule;

import com.facebook.presto.matching.Captures;
import com.facebook.presto.matching.Pattern;
import com.facebook.presto.spi.plan.AggregationNode;
import com.facebook.presto.spi.relation.VariableReferenceExpression;
import com.facebook.presto.sql.planner.iterative.GroupReference;
import com.facebook.presto.sql.planner.iterative.Rule;

import java.util.stream.Collectors;
import java.util.stream.Stream;

import static com.facebook.presto.spi.plan.AggregationNode.Aggregation.removeDistinct;
import static com.facebook.presto.sql.planner.plan.Patterns.aggregation;

/**
* Removes distinct from aggregates where the combination of aggregate columns and grouping variables contain a unique key.
* Ultimately this optimization needs to happen before the mark distinct optimization occurs.
* This will require moving the operations that transform away original expressions earlier in the sequence
* as logical property computation is designed to sit behind that transformation. For now this rule
* can be tested by disabling the mark distinct rule.
*/
public class RemoveRedundantAggregateDistinct
implements Rule<AggregationNode>
simmend marked this conversation as resolved.
Show resolved Hide resolved
{
private static final Pattern<AggregationNode> PATTERN = aggregation()
.matching(RemoveRedundantAggregateDistinct::aggregateDistinctOfUniqueKey);

private static boolean aggregateDistinctOfUniqueKey(AggregationNode node)
{
simmend marked this conversation as resolved.
Show resolved Hide resolved
return !node.getAggregations().isEmpty() &&
((GroupReference) node.getSource()).getLogicalProperties().isPresent() &&
node.getAggregations().values().stream()
.filter(AggregationNode.Aggregation::isDistinct)
.anyMatch(a -> ((GroupReference) node.getSource()).getLogicalProperties().get().isDistinct(
Stream.concat(node.getGroupingKeys().stream().map(VariableReferenceExpression.class::cast),
a.getArguments().stream().map(VariableReferenceExpression.class::cast)).collect(Collectors.toSet())));
}

@Override
public Pattern<AggregationNode> getPattern()
{
return PATTERN;
}

@Override
public Result apply(AggregationNode node, Captures captures, Context context)
{
//create new AggregateNode same as original but with distinct turned off for
//any aggregate function whose argument variables + grouping variables form a unique key
return Result.ofPlanNode(new AggregationNode(
node.getSourceLocation(),
context.getIdAllocator().getNextId(),
node.getSource(),
node.getAggregations().entrySet().stream().collect(Collectors.toMap(e -> e.getKey(), e ->
(e.getValue().isDistinct() &&
((GroupReference) node.getSource()).getLogicalProperties().get().isDistinct(
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Since you have to run this same logic again in apply, might as well use a simpler pattern, and check for match once here.

Stream.concat(node.getGroupingKeys().stream().map(VariableReferenceExpression.class::cast),
(e.getValue()).getArguments().stream().map(VariableReferenceExpression.class::cast)).collect(Collectors.toSet()))) ?
removeDistinct(e.getValue()) : (e.getValue()))),
node.getGroupingSets(),
node.getPreGroupedVariables(),
node.getStep(),
node.getHashVariable(),
node.getGroupIdVariable()));
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,55 @@
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.facebook.presto.sql.planner.iterative.rule;

import com.facebook.presto.matching.Captures;
import com.facebook.presto.matching.Pattern;
import com.facebook.presto.spi.plan.AggregationNode;
import com.facebook.presto.sql.planner.iterative.GroupReference;
import com.facebook.presto.sql.planner.iterative.Rule;

import java.util.stream.Collectors;

import static com.facebook.presto.sql.planner.plan.Patterns.aggregation;

/**
* Removes distinct operations where the grouping variables contain a unique key.
*/
public class RemoveRedundantDistinct
implements Rule<AggregationNode>
{
private static final Pattern<AggregationNode> PATTERN = aggregation()
.matching(AggregationNode::isDistinct)
.matching(RemoveRedundantDistinct::distinctOfUniqueKey);

private static boolean distinctOfUniqueKey(AggregationNode node)
{
simmend marked this conversation as resolved.
Show resolved Hide resolved
return node.hasNonEmptyGroupingSet() &&
node.getAggregations().isEmpty() &&
((GroupReference) node.getSource()).getLogicalProperties().isPresent() &&
((GroupReference) node.getSource()).getLogicalProperties().get().isDistinct(node.getGroupingKeys().stream().collect(Collectors.toSet()));
}

@Override
public Pattern<AggregationNode> getPattern()
{
return PATTERN;
}

@Override
public Result apply(AggregationNode node, Captures captures, Context context)
{
simmend marked this conversation as resolved.
Show resolved Hide resolved
return Result.ofPlanNode(node.getSource());
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.facebook.presto.sql.planner.iterative.rule;

import com.facebook.presto.matching.Captures;
import com.facebook.presto.matching.Pattern;
import com.facebook.presto.spi.plan.DistinctLimitNode;
import com.facebook.presto.sql.planner.iterative.GroupReference;
import com.facebook.presto.sql.planner.iterative.Rule;

import static com.google.common.base.Preconditions.checkArgument;

public class RemoveRedundantDistinctLimit
implements Rule<DistinctLimitNode>
{
private static final Pattern<DistinctLimitNode> PATTERN = Pattern.typeOf(DistinctLimitNode.class)
simmend marked this conversation as resolved.
Show resolved Hide resolved
.matching(RemoveRedundantDistinctLimit::singleRowInput);

private static boolean singleRowInput(DistinctLimitNode node)
{
return (((GroupReference) node.getSource()).getLogicalProperties().isPresent() &&
((GroupReference) node.getSource()).getLogicalProperties().get().isAtMostSingleRow());
}

@Override
public Pattern<DistinctLimitNode> getPattern()
{
return PATTERN;
}

@Override
public Result apply(DistinctLimitNode node, Captures captures, Context context)
{
checkArgument(!node.getHashVariable().isPresent(), "HashSymbol should be empty");
return Result.ofPlanNode(node.getSource());
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.facebook.presto.sql.planner.iterative.rule;

import com.facebook.presto.matching.Captures;
import com.facebook.presto.matching.Pattern;
import com.facebook.presto.spi.plan.LimitNode;
import com.facebook.presto.sql.planner.iterative.GroupReference;
import com.facebook.presto.sql.planner.iterative.Rule;

import static com.facebook.presto.sql.planner.plan.Patterns.limit;

/**
* Remove Limit node when the subplan is guaranteed to produce fewer rows than the limit.
*/
public class RemoveRedundantLimit
implements Rule<LimitNode>
{
// Applies to both LimitNode with ties and LimitNode without ties.
private static final Pattern<LimitNode> PATTERN = limit()
.matching(RemoveRedundantLimit::isAtMost);

@Override
public Pattern<LimitNode> getPattern()
{
return PATTERN;
}

private static boolean isAtMost(LimitNode node)
{
return ((GroupReference) node.getSource()).getLogicalProperties().isPresent() &&
((GroupReference) node.getSource()).getLogicalProperties().get().isAtMost(node.getCount());
}

@Override
public Result apply(LimitNode limit, Captures captures, Context context)
{
return Result.ofPlanNode(limit.getSource());
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,50 @@
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.facebook.presto.sql.planner.iterative.rule;

import com.facebook.presto.matching.Captures;
import com.facebook.presto.matching.Pattern;
import com.facebook.presto.sql.planner.iterative.GroupReference;
import com.facebook.presto.sql.planner.iterative.Rule;
import com.facebook.presto.sql.planner.plan.SortNode;

import static com.facebook.presto.sql.planner.plan.Patterns.sort;

/**
* Removes sort operations where the input is provably at most one row.
*/
public class RemoveRedundantSort
implements Rule<SortNode>
{
private static final Pattern<SortNode> PATTERN = sort()
.matching(RemoveRedundantSort::singleRowInput);

private static boolean singleRowInput(SortNode node)
{
return ((GroupReference) node.getSource()).getLogicalProperties().isPresent() &&
((GroupReference) node.getSource()).getLogicalProperties().get().isAtMostSingleRow();
}

@Override
public Pattern<SortNode> getPattern()
{
return PATTERN;
}

@Override
public Result apply(SortNode node, Captures captures, Context context)
{
return Result.ofPlanNode(node.getSource());
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.facebook.presto.sql.planner.iterative.rule;

import com.facebook.presto.matching.Captures;
import com.facebook.presto.matching.Pattern;
import com.facebook.presto.spi.plan.TopNNode;
import com.facebook.presto.sql.planner.iterative.GroupReference;
import com.facebook.presto.sql.planner.iterative.Rule;

import static com.facebook.presto.sql.planner.plan.Patterns.topN;

/**
* Removes top N operations where the input is provably at most one row.
*/
public class RemoveRedundantTopN
implements Rule<TopNNode>
{
private static final Pattern<TopNNode> PATTERN = topN()
.matching(RemoveRedundantTopN::singleRowInput);

private static boolean singleRowInput(TopNNode node)
{
return (node.getStep() == TopNNode.Step.SINGLE &&
((GroupReference) node.getSource()).getLogicalProperties().isPresent() &&
((GroupReference) node.getSource()).getLogicalProperties().get().isAtMostSingleRow());
}

@Override
public Pattern<TopNNode> getPattern()
{
return PATTERN;
}

@Override
public Result apply(TopNNode node, Captures captures, Context context)
{
return Result.ofPlanNode(node.getSource());
}
}
Loading