-
Notifications
You must be signed in to change notification settings - Fork 3.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[feature](Nereids): add ColumnPruningPostProcessor. (#32800)
(cherry picked from commit 5970f98)
- Loading branch information
Showing
7 changed files
with
195 additions
and
21 deletions.
There are no files selected for viewing
107 changes: 107 additions & 0 deletions
107
...ore/src/main/java/org/apache/doris/nereids/processor/post/ColumnPruningPostProcessor.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,107 @@ | ||
| // 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.processor.post; | ||
|
|
||
| import org.apache.doris.nereids.CascadesContext; | ||
| import org.apache.doris.nereids.annotation.DependsRules; | ||
| import org.apache.doris.nereids.trees.expressions.NamedExpression; | ||
| import org.apache.doris.nereids.trees.expressions.Slot; | ||
| import org.apache.doris.nereids.trees.plans.Plan; | ||
| import org.apache.doris.nereids.trees.plans.physical.AbstractPhysicalJoin; | ||
| import org.apache.doris.nereids.trees.plans.physical.AbstractPhysicalPlan; | ||
| import org.apache.doris.nereids.trees.plans.physical.PhysicalDistribute; | ||
| import org.apache.doris.nereids.trees.plans.physical.PhysicalProject; | ||
|
|
||
| import java.util.ArrayList; | ||
| import java.util.List; | ||
| import java.util.Set; | ||
| import java.util.stream.Collectors; | ||
| import java.util.stream.Stream; | ||
|
|
||
| /** | ||
| * Prune column for Join-Cluster | ||
| */ | ||
| @DependsRules({ | ||
| MergeProjectPostProcessor.class | ||
| }) | ||
| public class ColumnPruningPostProcessor extends PlanPostProcessor { | ||
| @Override | ||
| public PhysicalProject visitPhysicalProject(PhysicalProject<? extends Plan> project, CascadesContext ctx) { | ||
| Plan child = project.child(); | ||
| Plan newChild = child.accept(this, ctx); | ||
| if (newChild instanceof AbstractPhysicalJoin) { | ||
| AbstractPhysicalJoin<? extends Plan, ? extends Plan> join = (AbstractPhysicalJoin) newChild; | ||
| Plan left = join.left(); | ||
| Plan right = join.right(); | ||
| Set<Slot> leftOutput = left.getOutputSet(); | ||
| Set<Slot> rightOutput = right.getOutputSet(); | ||
|
|
||
| Set<Slot> usedSlots = project.getProjects().stream().flatMap(ne -> ne.getInputSlots().stream()) | ||
| .collect(Collectors.toSet()); | ||
|
|
||
| Stream.concat(join.getHashJoinConjuncts().stream(), join.getOtherJoinConjuncts().stream()) | ||
| .flatMap(expr -> expr.getInputSlots().stream()) | ||
| .forEach(usedSlots::add); | ||
| join.getMarkJoinSlotReference().ifPresent(usedSlots::add); | ||
|
|
||
| List<NamedExpression> leftNewProjections = new ArrayList<>(); | ||
| List<NamedExpression> rightNewProjections = new ArrayList<>(); | ||
|
|
||
| for (Slot usedSlot : usedSlots) { | ||
| if (leftOutput.contains(usedSlot)) { | ||
| leftNewProjections.add(usedSlot); | ||
| } else if (rightOutput.contains(usedSlot)) { | ||
| rightNewProjections.add(usedSlot); | ||
| } | ||
| } | ||
|
|
||
| Plan newLeft; | ||
| if (left instanceof PhysicalDistribute) { | ||
| newLeft = leftNewProjections.size() != leftOutput.size() && !leftNewProjections.isEmpty() | ||
| ? left.withChildren(new PhysicalProject<>(leftNewProjections, | ||
| left.getLogicalProperties(), left.child(0))) | ||
| : left; | ||
| } else { | ||
| newLeft = leftNewProjections.size() != leftOutput.size() && !leftNewProjections.isEmpty() | ||
| ? new PhysicalProject<>(leftNewProjections, left.getLogicalProperties(), | ||
| left).copyStatsAndGroupIdFrom((AbstractPhysicalPlan) left) | ||
| : left; | ||
| } | ||
| Plan newRight; | ||
| if (right instanceof PhysicalDistribute) { | ||
| newRight = rightNewProjections.size() != rightOutput.size() && !rightNewProjections.isEmpty() | ||
| ? right.withChildren(new PhysicalProject<>(rightNewProjections, | ||
| right.getLogicalProperties(), right.child(0))) | ||
| : right; | ||
| } else { | ||
| newRight = rightNewProjections.size() != rightOutput.size() && !rightNewProjections.isEmpty() | ||
| ? new PhysicalProject<>(rightNewProjections, right.getLogicalProperties(), | ||
| right).copyStatsAndGroupIdFrom((AbstractPhysicalPlan) right) | ||
| : right; | ||
| } | ||
|
|
||
| if (newLeft != left || newRight != right) { | ||
| return (PhysicalProject) project.withChildren(join.withChildren(newLeft, newRight)); | ||
| } else { | ||
| return project; | ||
| } | ||
| } | ||
| return project; | ||
| } | ||
| } | ||
|
|
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
62 changes: 62 additions & 0 deletions
62
...re/src/test/java/org/apache/doris/nereids/postprocess/ColumnPruningPostProcessorTest.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,62 @@ | ||
| // 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.postprocess; | ||
|
|
||
| import org.apache.doris.nereids.processor.post.ColumnPruningPostProcessor; | ||
| import org.apache.doris.nereids.rules.rewrite.InferFilterNotNull; | ||
| import org.apache.doris.nereids.trees.plans.JoinType; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalOlapScan; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalPlan; | ||
| import org.apache.doris.nereids.trees.plans.physical.PhysicalNestedLoopJoin; | ||
| import org.apache.doris.nereids.trees.plans.physical.PhysicalPlan; | ||
| import org.apache.doris.nereids.trees.plans.physical.PhysicalProject; | ||
| import org.apache.doris.nereids.util.LogicalPlanBuilder; | ||
| import org.apache.doris.nereids.util.MemoPatternMatchSupported; | ||
| import org.apache.doris.nereids.util.MemoTestUtils; | ||
| import org.apache.doris.nereids.util.PlanChecker; | ||
| import org.apache.doris.nereids.util.PlanConstructor; | ||
|
|
||
| import com.google.common.collect.ImmutableList; | ||
| import org.junit.jupiter.api.Assertions; | ||
| import org.junit.jupiter.api.Test; | ||
|
|
||
| class ColumnPruningPostProcessorTest implements MemoPatternMatchSupported { | ||
| private final LogicalOlapScan scan1 = PlanConstructor.newLogicalOlapScan(0, "t1", 0); | ||
| private final LogicalOlapScan scan2 = PlanConstructor.newLogicalOlapScan(1, "t2", 0); | ||
|
|
||
| @Test | ||
| void test() { | ||
| LogicalPlan plan = new LogicalPlanBuilder(scan1) | ||
| .join(scan2, JoinType.INNER_JOIN, ImmutableList.of()) | ||
| .project(ImmutableList.of(0, 2)) | ||
| .build(); | ||
|
|
||
| PhysicalPlan physicalPlan = PlanChecker.from(MemoTestUtils.createConnectContext(), plan) | ||
| .applyTopDown(new InferFilterNotNull()) | ||
| .implement() | ||
| .getPhysicalPlan(); | ||
|
|
||
| ColumnPruningPostProcessor processor = new ColumnPruningPostProcessor(); | ||
| PhysicalPlan newPlan = (PhysicalPlan) physicalPlan.accept(processor, null); | ||
|
|
||
| Assertions.assertTrue(newPlan instanceof PhysicalProject); | ||
| Assertions.assertTrue(newPlan.child(0) instanceof PhysicalNestedLoopJoin); | ||
| Assertions.assertTrue(newPlan.child(0).child(0) instanceof PhysicalProject); | ||
| Assertions.assertTrue(newPlan.child(0).child(1) instanceof PhysicalProject); | ||
| } | ||
| } |
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