-
Notifications
You must be signed in to change notification settings - Fork 3.4k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[feature](Nereids): push down topN through join (#24720)
Push TopN through Join. JoinType just can be left/right outer join or cross join, because data of their one child can't be filtered. new TopN is (original limit + original offset, 0) as limit and offset.
- Loading branch information
Showing
12 changed files
with
312 additions
and
69 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
108 changes: 108 additions & 0 deletions
108
fe/fe-core/src/main/java/org/apache/doris/nereids/rules/rewrite/PushdownTopNThroughJoin.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,108 @@ | ||
| // Licensed to the Apache Software Foundation (ASF) under one | ||
| // or more contributor license agreements. See the NOTICE file | ||
| // distributed with this work for additional information | ||
| // regarding copyright ownership. The ASF licenses this file | ||
| // to you 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 org.apache.doris.nereids.rules.rewrite; | ||
|
|
||
| import org.apache.doris.nereids.properties.OrderKey; | ||
| import org.apache.doris.nereids.rules.Rule; | ||
| import org.apache.doris.nereids.rules.RuleType; | ||
| import org.apache.doris.nereids.trees.expressions.Slot; | ||
| import org.apache.doris.nereids.trees.plans.Plan; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalJoin; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalProject; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalTopN; | ||
| import org.apache.doris.nereids.util.Utils; | ||
|
|
||
| import com.google.common.collect.ImmutableList; | ||
|
|
||
| import java.util.List; | ||
| import java.util.Set; | ||
| import java.util.stream.Collectors; | ||
|
|
||
| /** | ||
| * Push down TopN through Outer Join into left child ..... | ||
| */ | ||
| public class PushdownTopNThroughJoin implements RewriteRuleFactory { | ||
|
|
||
| @Override | ||
| public List<Rule> buildRules() { | ||
| return ImmutableList.of( | ||
| // topN -> join | ||
| logicalTopN(logicalJoin()) | ||
| // TODO: complex orderby | ||
| .when(topN -> topN.getOrderKeys().stream().map(OrderKey::getExpr) | ||
| .allMatch(Slot.class::isInstance)) | ||
| .then(topN -> { | ||
| LogicalJoin<Plan, Plan> join = topN.child(); | ||
| Plan newJoin = pushLimitThroughJoin(topN, join); | ||
| if (newJoin == null || topN.child().children().equals(newJoin.children())) { | ||
| return null; | ||
| } | ||
| return topN.withChildren(newJoin); | ||
| }) | ||
| .toRule(RuleType.PUSH_TOP_N_THROUGH_JOIN), | ||
|
|
||
| // topN -> project -> join | ||
| logicalTopN(logicalProject(logicalJoin()).when(LogicalProject::isAllSlots)) | ||
| // TODO: complex project | ||
| .when(topN -> topN.getOrderKeys().stream().map(OrderKey::getExpr) | ||
| .allMatch(Slot.class::isInstance)) | ||
| .then(topN -> { | ||
| LogicalProject<LogicalJoin<Plan, Plan>> project = topN.child(); | ||
| LogicalJoin<Plan, Plan> join = project.child(); | ||
|
|
||
| Plan newJoin = pushLimitThroughJoin(topN, join); | ||
| if (newJoin == null || join.children().equals(newJoin.children())) { | ||
| return null; | ||
| } | ||
| return topN.withChildren(project.withChildren(newJoin)); | ||
| }).toRule(RuleType.PUSH_TOP_N_THROUGH_PROJECT_JOIN) | ||
| ); | ||
| } | ||
|
|
||
| private Plan pushLimitThroughJoin(LogicalTopN<? extends Plan> topN, LogicalJoin<Plan, Plan> join) { | ||
| switch (join.getJoinType()) { | ||
| case LEFT_OUTER_JOIN: | ||
| Set<Slot> rightOutputSet = join.right().getOutputSet(); | ||
| if (topN.getOrderKeys().stream().map(OrderKey::getExpr) | ||
| .anyMatch(e -> Utils.isIntersecting(rightOutputSet, e.getInputSlots()))) { | ||
| return null; | ||
| } | ||
| return join.withChildren(topN.withChildren(join.left()), join.right()); | ||
| case RIGHT_OUTER_JOIN: | ||
| Set<Slot> leftOutputSet = join.left().getOutputSet(); | ||
| if (topN.getOrderKeys().stream().map(OrderKey::getExpr) | ||
| .anyMatch(e -> Utils.isIntersecting(leftOutputSet, e.getInputSlots()))) { | ||
| return null; | ||
| } | ||
| return join.withChildren(join.left(), topN.withChildren(join.right())); | ||
| case CROSS_JOIN: | ||
| List<Slot> orderbySlots = topN.getOrderKeys().stream().map(OrderKey::getExpr) | ||
| .flatMap(e -> e.getInputSlots().stream()).collect(Collectors.toList()); | ||
| if (join.left().getOutputSet().containsAll(orderbySlots)) { | ||
| return join.withChildren(topN.withChildren(join.left()), join.right()); | ||
| } else if (join.right().getOutputSet().containsAll(orderbySlots)) { | ||
| return join.withChildren(join.left(), topN.withChildren(join.right())); | ||
| } else { | ||
| return null; | ||
| } | ||
| default: | ||
| // don't push limit. | ||
| return null; | ||
| } | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.