-
Notifications
You must be signed in to change notification settings - Fork 2.8k
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
Add PushdownTopN through Project and Outer Join rules #419
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,113 @@ | ||
/* | ||
* 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 io.prestosql.sql.planner.iterative.rule; | ||
|
||
import com.google.common.collect.ImmutableList; | ||
import com.google.common.collect.ImmutableSet; | ||
import com.google.common.collect.Range; | ||
import io.prestosql.matching.Capture; | ||
import io.prestosql.matching.Captures; | ||
import io.prestosql.matching.Pattern; | ||
import io.prestosql.sql.planner.Symbol; | ||
import io.prestosql.sql.planner.iterative.Lookup; | ||
import io.prestosql.sql.planner.iterative.Rule; | ||
import io.prestosql.sql.planner.plan.JoinNode; | ||
import io.prestosql.sql.planner.plan.PlanNode; | ||
import io.prestosql.sql.planner.plan.TopNNode; | ||
|
||
import java.util.List; | ||
|
||
import static io.prestosql.matching.Capture.newCapture; | ||
import static io.prestosql.sql.planner.optimizations.QueryCardinalityUtil.extractCardinality; | ||
import static io.prestosql.sql.planner.plan.JoinNode.Type.FULL; | ||
import static io.prestosql.sql.planner.plan.JoinNode.Type.LEFT; | ||
import static io.prestosql.sql.planner.plan.JoinNode.Type.RIGHT; | ||
import static io.prestosql.sql.planner.plan.Patterns.Join.type; | ||
import static io.prestosql.sql.planner.plan.Patterns.TopN.step; | ||
import static io.prestosql.sql.planner.plan.Patterns.join; | ||
import static io.prestosql.sql.planner.plan.Patterns.source; | ||
import static io.prestosql.sql.planner.plan.Patterns.topN; | ||
import static io.prestosql.sql.planner.plan.TopNNode.Step.PARTIAL; | ||
|
||
/** | ||
* Transforms: | ||
* <pre> | ||
* - TopN (partial) | ||
* - Join (left, right or full) | ||
* - left source | ||
* - right source | ||
* </pre> | ||
* Into: | ||
* <pre> | ||
* - Join | ||
* - TopN (present if Join is left or outer, not already limited, and orderBy symbols come from left source) | ||
* - left source | ||
* - TopN (present if Join is right or outer, not already limited, and orderBy symbols come from right source) | ||
* - right source | ||
* </pre> | ||
*/ | ||
public class PushTopNThroughOuterJoin | ||
implements Rule<TopNNode> | ||
{ | ||
private static final Capture<JoinNode> JOIN_CHILD = newCapture(); | ||
|
||
private static final Pattern<TopNNode> PATTERN = | ||
topN().with(step().equalTo(PARTIAL)) | ||
.with(source().matching( | ||
join().capturedAs(JOIN_CHILD).with(type().matching(type -> type == LEFT || type == RIGHT || type == FULL)))); | ||
|
||
@Override | ||
public Pattern<TopNNode> getPattern() | ||
{ | ||
return PATTERN; | ||
} | ||
|
||
@Override | ||
public Result apply(TopNNode parent, Captures captures, Context context) | ||
{ | ||
JoinNode joinNode = captures.get(JOIN_CHILD); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. if the There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Actually. Make this rule only execute for |
||
|
||
List<Symbol> orderBySymbols = parent.getOrderingScheme().getOrderBy(); | ||
|
||
PlanNode left = joinNode.getLeft(); | ||
PlanNode right = joinNode.getRight(); | ||
JoinNode.Type type = joinNode.getType(); | ||
|
||
if ((type == LEFT || type == FULL) | ||
&& ImmutableSet.copyOf(left.getOutputSymbols()).containsAll(orderBySymbols) | ||
&& !isLimited(left, context.getLookup(), parent.getCount())) { | ||
return Result.ofPlanNode( | ||
joinNode.replaceChildren(ImmutableList.of( | ||
parent.replaceChildren(ImmutableList.of(left)), | ||
right))); | ||
} | ||
|
||
if ((type == RIGHT || type == FULL) | ||
&& ImmutableSet.copyOf(right.getOutputSymbols()).containsAll(orderBySymbols) | ||
&& !isLimited(right, context.getLookup(), parent.getCount())) { | ||
return Result.ofPlanNode( | ||
joinNode.replaceChildren(ImmutableList.of( | ||
left, | ||
parent.replaceChildren(ImmutableList.of(right))))); | ||
} | ||
|
||
return Result.empty(); | ||
} | ||
|
||
private static boolean isLimited(PlanNode node, Lookup lookup, long limit) | ||
{ | ||
Range<Long> cardinality = extractCardinality(node, lookup); | ||
return cardinality.hasUpperBound() && cardinality.upperEndpoint() <= limit; | ||
} | ||
} |
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,110 @@ | ||
/* | ||
* 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 io.prestosql.sql.planner.iterative.rule; | ||
|
||
import com.google.common.collect.ImmutableList; | ||
import io.prestosql.matching.Capture; | ||
import io.prestosql.matching.Captures; | ||
import io.prestosql.matching.Pattern; | ||
import io.prestosql.sql.planner.Symbol; | ||
import io.prestosql.sql.planner.iterative.Rule; | ||
import io.prestosql.sql.planner.optimizations.SymbolMapper; | ||
import io.prestosql.sql.planner.plan.Assignments; | ||
import io.prestosql.sql.planner.plan.FilterNode; | ||
import io.prestosql.sql.planner.plan.PlanNode; | ||
import io.prestosql.sql.planner.plan.ProjectNode; | ||
import io.prestosql.sql.planner.plan.TableScanNode; | ||
import io.prestosql.sql.planner.plan.TopNNode; | ||
import io.prestosql.sql.tree.Expression; | ||
import io.prestosql.sql.tree.SymbolReference; | ||
|
||
import java.util.List; | ||
import java.util.Optional; | ||
|
||
import static io.prestosql.matching.Capture.newCapture; | ||
import static io.prestosql.sql.planner.plan.Patterns.project; | ||
import static io.prestosql.sql.planner.plan.Patterns.source; | ||
import static io.prestosql.sql.planner.plan.Patterns.topN; | ||
|
||
/** | ||
* Transforms: | ||
* <pre> | ||
* - TopN | ||
* - Project (non-identity) | ||
* - Source other than Filter(TableScan) or TableScan | ||
* </pre> | ||
* Into: | ||
* <pre> | ||
* - Project | ||
* - TopN | ||
* - Source | ||
* </pre> | ||
*/ | ||
public final class PushTopNThroughProject | ||
implements Rule<TopNNode> | ||
{ | ||
private static final Capture<ProjectNode> PROJECT_CHILD = newCapture(); | ||
|
||
private static final Pattern<TopNNode> PATTERN = | ||
topN() | ||
.with(source().matching( | ||
project() | ||
// do not push topN through identity projection which could be there for column pruning purposes | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. We could potentially combine two rules into single one, e.g: try to pushdown though project and into connector There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. yeah, a rule set; i created #7029 for this, let's move discussion over there |
||
.matching(projectNode -> !projectNode.isIdentity()) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. why not? because optimizer would loop forever? There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Correct, same is here: There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Please, add a comment about this. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. nit: There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. which There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. |
||
.capturedAs(PROJECT_CHILD) | ||
// do not push topN between projection and table scan so that they can be merged into a PageProcessor | ||
.with(source().matching(node -> !(node instanceof TableScanNode))))); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. nit: There is There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I think this could be taken care of in the future. |
||
|
||
@Override | ||
public Pattern<TopNNode> getPattern() | ||
{ | ||
return PATTERN; | ||
} | ||
|
||
@Override | ||
public Result apply(TopNNode parent, Captures captures, Context context) | ||
{ | ||
ProjectNode projectNode = captures.get(PROJECT_CHILD); | ||
|
||
// do not push topN between projection and filter(table scan) so that they can be merged into a PageProcessor | ||
PlanNode projectSource = context.getLookup().resolve(projectNode.getSource()); | ||
if (projectSource instanceof FilterNode) { | ||
PlanNode filterSource = context.getLookup().resolve(((FilterNode) projectSource).getSource()); | ||
if (filterSource instanceof TableScanNode) { | ||
return Result.empty(); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Why do we limit this case? I would think this rule should not care about whether there's a TableScan or Filter involved. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. also, there's another limitation in the
I was about to ask @sopel39 and @kokosing about that, because it was their request. I want to add some explanatory comment. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. @martint if you push topN below projection that is above filter or table scan then such projection won't be merged as a single If such topN node is There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more.
It's fine to have different but complementary constraints in the pattern vs in apply. Sometimes there are complex cases that cannot be easily described in terms of patterns. But if they can, there's better opportunity for the pattern matcher to do it more efficiently.
Yes, please do! My general rule of thumb is "if I were to look at some code I wrote a few months down the road, would I be able to figure out what it's doing or the motivation?". If not, a comment is warranted. In this case, it's not entirely obvious why this pattern is excluded, so let's add an explanation. |
||
} | ||
} | ||
|
||
Optional<SymbolMapper> symbolMapper = symbolMapper(parent.getOrderingScheme().getOrderBy(), projectNode.getAssignments()); | ||
if (!symbolMapper.isPresent()) { | ||
return Result.empty(); | ||
} | ||
|
||
TopNNode mappedTopN = symbolMapper.get().map(parent, projectNode.getSource(), context.getIdAllocator().getNextId()); | ||
return Result.ofPlanNode(projectNode.replaceChildren(ImmutableList.of(mappedTopN))); | ||
} | ||
|
||
private Optional<SymbolMapper> symbolMapper(List<Symbol> symbols, Assignments assignments) | ||
{ | ||
SymbolMapper.Builder mapper = SymbolMapper.builder(); | ||
for (Symbol symbol : symbols) { | ||
Expression expression = assignments.get(symbol); | ||
if (!(expression instanceof SymbolReference)) { | ||
return Optional.empty(); | ||
kokosing marked this conversation as resolved.
Show resolved
Hide resolved
|
||
} | ||
mapper.put(symbol, Symbol.from(expression)); | ||
} | ||
return Optional.of(mapper.build()); | ||
} | ||
} |
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -24,6 +24,7 @@ | |
import io.prestosql.sql.planner.plan.PlanNode; | ||
import io.prestosql.sql.planner.plan.PlanVisitor; | ||
import io.prestosql.sql.planner.plan.ProjectNode; | ||
import io.prestosql.sql.planner.plan.TopNNode; | ||
import io.prestosql.sql.planner.plan.ValuesNode; | ||
|
||
import static com.google.common.collect.Iterables.getOnlyElement; | ||
|
@@ -143,13 +144,23 @@ public Range<Long> visitValues(ValuesNode node, Void context) | |
@Override | ||
public Range<Long> visitLimit(LimitNode node, Void context) | ||
{ | ||
Range<Long> sourceCardinalityRange = node.getSource().accept(this, null); | ||
long upper = node.getCount(); | ||
return applyLimit(node.getSource(), node.getCount()); | ||
} | ||
|
||
@Override | ||
public Range<Long> visitTopN(TopNNode node, Void context) | ||
{ | ||
return applyLimit(node.getSource(), node.getCount()); | ||
} | ||
|
||
private Range<Long> applyLimit(PlanNode source, long limit) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. nit: There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more.
I don't think we should rename it to visitXXX since it makes it easy to confuse with the methods that are implementations of the visitor interface. This is just an internal utility method. |
||
{ | ||
Range<Long> sourceCardinalityRange = source.accept(this, null); | ||
if (sourceCardinalityRange.hasUpperBound()) { | ||
upper = min(sourceCardinalityRange.upperEndpoint(), node.getCount()); | ||
limit = min(sourceCardinalityRange.upperEndpoint(), limit); | ||
} | ||
long lower = min(upper, sourceCardinalityRange.lowerEndpoint()); | ||
return Range.closed(lower, upper); | ||
long lower = min(limit, sourceCardinalityRange.lowerEndpoint()); | ||
return Range.closed(lower, limit); | ||
} | ||
} | ||
} |
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -35,6 +35,7 @@ | |
import io.prestosql.sql.planner.plan.SemiJoinNode; | ||
import io.prestosql.sql.planner.plan.StatisticsWriterNode; | ||
import io.prestosql.sql.planner.plan.TableScanNode; | ||
import io.prestosql.sql.planner.plan.TopNNode; | ||
import io.prestosql.sql.planner.plan.ValuesNode; | ||
import io.prestosql.sql.tree.LongLiteral; | ||
import io.prestosql.tests.QueryTemplate; | ||
|
@@ -77,6 +78,7 @@ | |
import static io.prestosql.sql.planner.assertions.PlanMatchPattern.sort; | ||
import static io.prestosql.sql.planner.assertions.PlanMatchPattern.strictTableScan; | ||
import static io.prestosql.sql.planner.assertions.PlanMatchPattern.tableScan; | ||
import static io.prestosql.sql.planner.assertions.PlanMatchPattern.topN; | ||
import static io.prestosql.sql.planner.assertions.PlanMatchPattern.values; | ||
import static io.prestosql.sql.planner.optimizations.PlanNodeSearcher.searchFrom; | ||
import static io.prestosql.sql.planner.plan.AggregationNode.Step.FINAL; | ||
|
@@ -92,6 +94,7 @@ | |
import static io.prestosql.sql.planner.plan.JoinNode.Type.INNER; | ||
import static io.prestosql.sql.planner.plan.JoinNode.Type.LEFT; | ||
import static io.prestosql.sql.tree.SortItem.NullOrdering.LAST; | ||
import static io.prestosql.sql.tree.SortItem.Ordering.ASCENDING; | ||
import static io.prestosql.sql.tree.SortItem.Ordering.DESCENDING; | ||
import static io.prestosql.tests.QueryTemplate.queryTemplate; | ||
import static io.prestosql.util.MorePredicates.isInstanceOfAny; | ||
|
@@ -255,6 +258,22 @@ public void testJoinWithOrderBySameKey() | |
tableScan("lineitem", ImmutableMap.of("LINEITEM_OK", "orderkey")))))); | ||
} | ||
|
||
@Test | ||
public void testTopNPushdownToJoinSource() | ||
{ | ||
assertPlan("SELECT n.name, r.name FROM nation n LEFT JOIN region r ON n.regionkey = r.regionkey ORDER BY n.comment LIMIT 1", | ||
anyTree( | ||
project( | ||
topN(1, ImmutableList.of(sort("N_COMM", ASCENDING, LAST)), TopNNode.Step.FINAL, | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. ditto |
||
anyTree( | ||
join(LEFT, ImmutableList.of(equiJoinClause("N_KEY", "R_KEY")), | ||
project( | ||
topN(1, ImmutableList.of(sort("N_COMM", ASCENDING, LAST)), TopNNode.Step.PARTIAL, | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. put each argument in new line There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I tried to follow the formatting used in this class. |
||
tableScan("nation", ImmutableMap.of("N_NAME", "name", "N_KEY", "regionkey", "N_COMM", "comment")))), | ||
anyTree( | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Nits: replace with There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. can't find There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Because it does not exists yet. It would be the best if it would have existed. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I think it could be added in another PR. I could give it a try later. |
||
tableScan("region", ImmutableMap.of("R_NAME", "name", "R_KEY", "regionkey"))))))))); | ||
} | ||
|
||
@Test | ||
public void testUncorrelatedSubqueries() | ||
{ | ||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
this line belongs to previous commit.