forked from apache/doris
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
4 changed files
with
155 additions
and
1 deletion.
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
94 changes: 94 additions & 0 deletions
94
fe/fe-core/src/main/java/org/apache/doris/nereids/rules/rewrite/AdjustTopNProject.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,94 @@ | ||
| // 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.Alias; | ||
| import org.apache.doris.nereids.trees.expressions.Expression; | ||
| import org.apache.doris.nereids.trees.expressions.NamedExpression; | ||
| import org.apache.doris.nereids.trees.expressions.Slot; | ||
| import org.apache.doris.nereids.trees.expressions.SlotReference; | ||
| import org.apache.doris.nereids.trees.plans.Plan; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalProject; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalTopN; | ||
|
|
||
| import java.util.ArrayList; | ||
| import java.util.HashMap; | ||
| import java.util.List; | ||
| import java.util.Map; | ||
| import java.util.Set; | ||
|
|
||
| /** | ||
| * | ||
| * try to reduce shuffle cost of topN operator | ||
| * | ||
| * topn(orderKey=[a]) | ||
| * --> project(a+1 as x, a+2 as y, a) | ||
| * --> any(output(a)) | ||
| * => | ||
| * project(a+1 as x, a+2 as y, a) | ||
| * --> topn(orderKey=[a]) | ||
| * --> any(output(a)) | ||
| * | ||
| */ | ||
| public class AdjustTopNProject extends OneRewriteRuleFactory { | ||
| @Override | ||
| public Rule build() { | ||
| return logicalTopN(logicalProject()) | ||
| .then(topN -> adjust(topN)).toRule(RuleType.ADJUST_TOPN_PROJECT); | ||
| } | ||
|
|
||
| private Plan adjust(LogicalTopN<LogicalProject<Plan>> topN) { | ||
| LogicalProject<Plan> project = topN.child(); | ||
| Set<Slot> projectInputSlots = project.getInputSlots(); | ||
| Map<SlotReference, SlotReference> keyAsKey = new HashMap<>(); | ||
| for (NamedExpression proj : project.getProjects()) { | ||
| if (proj instanceof Alias && ((Alias) proj).child(0) instanceof SlotReference) { | ||
| keyAsKey.put((SlotReference) ((Alias) proj).toSlot(), (SlotReference) ((Alias) proj).child()); | ||
| } | ||
| } | ||
| boolean match = true; | ||
| List<OrderKey> newOrderKeys = new ArrayList<>(); | ||
| for (OrderKey orderKey : topN.getOrderKeys()) { | ||
| Expression orderExpr = orderKey.getExpr(); | ||
| if (orderExpr instanceof SlotReference) { | ||
| if (projectInputSlots.contains(orderExpr)) { | ||
| newOrderKeys.add(orderKey); | ||
| } else if (keyAsKey.containsKey(orderExpr)) { | ||
| newOrderKeys.add(orderKey.withExpression(keyAsKey.get(orderExpr))); | ||
| } else { | ||
| match = false; | ||
| break; | ||
| } | ||
| } else { | ||
| match = false; | ||
| break; | ||
| } | ||
| } | ||
| if (match) { | ||
| if (project.getProjects().size() >= project.getInputSlots().size()) { | ||
| LogicalTopN newTopN = topN.withChildren(project.children()).withOrderKeys(newOrderKeys); | ||
| project = (LogicalProject<Plan>) project.withChildren(newTopN); | ||
| return project; | ||
| } | ||
| } | ||
| return topN; | ||
| } | ||
| } |
55 changes: 55 additions & 0 deletions
55
fe/fe-core/src/test/java/org/apache/doris/nereids/rules/rewrite/AdjustTopNProjectTest.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,55 @@ | ||
| // 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 com.google.common.collect.ImmutableList; | ||
| import org.apache.doris.nereids.properties.OrderKey; | ||
| import org.apache.doris.nereids.trees.expressions.Alias; | ||
| import org.apache.doris.nereids.trees.expressions.Slot; | ||
| import org.apache.doris.nereids.trees.expressions.StatementScopeIdGenerator; | ||
| import org.apache.doris.nereids.trees.expressions.functions.scalar.DecodeAsVarchar; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalOlapScan; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalProject; | ||
| import org.apache.doris.nereids.trees.plans.logical.LogicalTopN; | ||
| 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 org.junit.jupiter.api.Test; | ||
|
|
||
| import java.util.List; | ||
|
|
||
| public class AdjustTopNProjectTest implements MemoPatternMatchSupported { | ||
| LogicalOlapScan score = new LogicalOlapScan(StatementScopeIdGenerator.newRelationId(), PlanConstructor.score); | ||
| @Test | ||
| void testTopNProject() { | ||
| Slot sid = score.getOutput().get(0); | ||
| Alias decodeSid = new Alias(new DecodeAsVarchar(sid)); | ||
| Alias aliasSid = new Alias(sid); | ||
| LogicalProject<LogicalOlapScan> bottomProject = new LogicalProject<>( | ||
| ImmutableList.of(decodeSid, aliasSid), score); | ||
| List<OrderKey> orderKeys = ImmutableList.of(new OrderKey(aliasSid.toSlot(), true, true)); | ||
| LogicalTopN topN = new LogicalTopN(orderKeys, 1, 1, bottomProject); | ||
| LogicalProject topProject = new LogicalProject(ImmutableList.of(decodeSid.toSlot()), topN); | ||
| PlanChecker.from(MemoTestUtils.createConnectContext(), topProject) | ||
| .applyTopDown(ImmutableList.of(new MergeProjects().build(), new AdjustTopNProject().build())) | ||
| .matches( | ||
| logicalProject( | ||
| logicalTopN(logicalOlapScan()))); | ||
| } | ||
| } |