database/doris
2
0
Fork 0
Code Issues Pull Requests Actions 3 Packages Projects Releases Wiki Activity

fix join count (#22619)

Browse Source
This commit is contained in:
谢健
2023-08-05 12:19:28 +08:00
committed by GitHub
parent 839b469879
commit 76da9f181d
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
fe/fe-core/src/main/java/org/apache/doris/nereids/memo/Memo.java
View File

@ -31,6 +31,7 @@ import org.apache.doris.nereids.trees.expressions.Expression;
import org.apache.doris.nereids.trees.plans.GroupPlan;
import org.apache.doris.nereids.trees.plans.LeafPlan;
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.LogicalPlan;
import org.apache.doris.nereids.trees.plans.logical.LogicalProject;
import org.apache.doris.nereids.trees.plans.physical.PhysicalDistribute;
@ -49,7 +50,6 @@ import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Optional;
import java.util.PriorityQueue;
import java.util.stream.Collectors;
@ -188,7 +188,7 @@ public class Memo {
for (Pair<Integer, Integer> child : children) {
maxJoinCount = Math.max(maxJoinCount, child.second);
}
if (group.isValidJoinGroup()) {
if (group.getLogicalExpression().getPlan() instanceof LogicalJoin) {
for (Pair<Integer, Integer> child : children) {
continuousJoinCount += child.first;
}