Skip to content

[opt](nereids) improve prune partition with lots of in (xxx)#46261

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.

Sign up for GitHub

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

Merged
924060929 merged 1 commit into from
Jan 2, 2025
Merged

[opt](nereids) improve prune partition with lots of in (xxx)#46261

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 5 additions & 4 deletions ...main/java/org/apache/doris/nereids/rules/expression/rules/OneRangePartitionEvaluator.java
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -63,6 +63,8 @@
import com.google.common.collect.Lists;
import com.google.common.collect.Maps;
import com.google.common.collect.Range;
import com.google.common.collect.RangeSet;
import com.google.common.collect.TreeRangeSet;

import java.util.ArrayList;
import java.util.HashMap;
Expand DownExpand Up@@ -363,13 +365,12 @@ public EvaluateRangeResult visitInPredicate(InPredicate inPredicate, EvaluateRan
if (exprRanges.containsKey(inPredicate.getCompareExpr())
&& inPredicate.getOptions().stream().allMatch(Literal.class::isInstance)) {
Expression compareExpr = inPredicate.getCompareExpr();
ColumnRange unionLiteralRange = ColumnRange.empty();
ColumnRange compareExprRange = result.childrenResult.get(0).columnRanges.get(compareExpr);
RangeSet<ColumnBound> union = TreeRangeSet.create();
for (Expression expr : inPredicate.getOptions()) {
unionLiteralRange = unionLiteralRange.union(
compareExprRange.intersect(ColumnRange.singleton((Literal) expr)));
union.addAll(compareExprRange.intersect(ColumnRange.singleton((Literal) expr)).asRanges());
}
result = intersectSlotRange(result, exprRanges, compareExpr, unionLiteralRange);
result = intersectSlotRange(result, exprRanges, compareExpr, new ColumnRange(union));
}
result = result.withRejectNot(false);
return result;
Expand Down