@Value.Enclosing public class AggregateReduceFunctionsRule extends RelRule<AggregateReduceFunctionsRule.Config> implements TransformationRule
Aggregates to simpler forms.
Rewrites:
Since many of these rewrites introduce multiple occurrences of simpler
forms like COUNT(x), the rule gathers common sub-expressions as it
goes.
CoreRules.AGGREGATE_REDUCE_FUNCTIONS| Modifier and Type | Class and Description |
|---|---|
static interface |
AggregateReduceFunctionsRule.Config
Rule configuration.
|
RelRule.Done, RelRule.MatchHandler<R extends RelOptRule>, RelRule.OperandBuilder, RelRule.OperandDetailBuilder<R extends RelNode>, RelRule.OperandTransformRelOptRule.ConverterRelOptRuleOperanddescription, operands, relBuilderFactory| Modifier | Constructor and Description |
|---|---|
protected |
AggregateReduceFunctionsRule(AggregateReduceFunctionsRule.Config config)
Creates an AggregateReduceFunctionsRule.
|
|
AggregateReduceFunctionsRule(Class<? extends Aggregate> aggregateClass,
RelBuilderFactory relBuilderFactory,
EnumSet<SqlKind> functionsToReduce)
Deprecated.
|
|
AggregateReduceFunctionsRule(RelOptRuleOperand operand,
RelBuilderFactory relBuilderFactory)
Deprecated.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
canReduce(AggregateCall call)
Returns whether this rule can reduce a given aggregate function call.
|
boolean |
canReduceAggCallByGrouping(Aggregate oldAggRel,
AggregateCall call)
Returns whether this rule can reduce some agg-call,
which its arg exists in the aggregate's group.
|
boolean |
matches(RelOptRuleCall call)
Returns whether this rule could possibly match the given operands.
|
protected void |
newAggregateRel(RelBuilder relBuilder,
Aggregate oldAggregate,
List<AggregateCall> newCalls)
Does a shallow clone of oldAggRel and updates aggCalls.
|
protected void |
newCalcRel(RelBuilder relBuilder,
RelDataType rowType,
List<RexNode> exprs)
Adds a calculation with the expressions to compute the original aggregate
calls from the decomposed ones.
|
void |
onMatch(RelOptRuleCall ruleCall)
Receives notification about a rule match.
|
any, convert, convert, convertList, convertOperand, convertOperand, equals, equals, getOperand, getOperands, getOutConvention, getOutTrait, hashCode, none, operand, operand, operand, operand, operand, operandJ, operandJ, some, toString, unorderedprotected AggregateReduceFunctionsRule(AggregateReduceFunctionsRule.Config config)
@Deprecated public AggregateReduceFunctionsRule(RelOptRuleOperand operand, RelBuilderFactory relBuilderFactory)
@Deprecated public AggregateReduceFunctionsRule(Class<? extends Aggregate> aggregateClass, RelBuilderFactory relBuilderFactory, EnumSet<SqlKind> functionsToReduce)
public boolean matches(RelOptRuleCall call)
RelOptRuleThis method is an opportunity to apply side-conditions to a rule. The
RelOptPlanner calls this method after matching all operands of
the rule, and before calling RelOptRule.onMatch(RelOptRuleCall).
In implementations of RelOptPlanner which may queue up a
matched RelOptRuleCall for a long time before calling
RelOptRule.onMatch(RelOptRuleCall), this method is beneficial because it
allows the planner to discard rules earlier in the process.
The default implementation of this method returns true.
It is acceptable for any implementation of this method to give a false
positives, that is, to say that the rule matches the operands but have
RelOptRule.onMatch(RelOptRuleCall) subsequently not generate any
successors.
The following script is useful to identify rules which commonly produce no successors. You should override this method for these rules:
awk ' /Apply rule/ {rule=$4; ruleCount[rule]++;} /generated 0 successors/ {ruleMiss[rule]++;} END { printf "%-30s %s %s\n", "Rule", "Fire", "Miss"; for (i in ruleCount) { printf "%-30s %5d %5d\n", i, ruleCount[i], ruleMiss[i]; } } ' FarragoTrace.log
matches in class RelOptRulecall - Rule call which has been determined to match all operands of
this rulepublic void onMatch(RelOptRuleCall ruleCall)
RelOptRulecall.rels holds the set of relational
expressions which match the operands to the rule;
call.rels[0] is the root expression.
Typically a rule would check that the nodes are valid matches, creates
a new expression, then calls back RelOptRuleCall.transformTo(org.apache.calcite.rel.RelNode, java.util.Map<org.apache.calcite.rel.RelNode, org.apache.calcite.rel.RelNode>, org.apache.calcite.plan.RelHintsPropagator) to
register the expression.
onMatch in class RelOptRuleruleCall - Rule callRelOptRule.matches(RelOptRuleCall)public boolean canReduce(AggregateCall call)
public boolean canReduceAggCallByGrouping(Aggregate oldAggRel, AggregateCall call)
protected void newAggregateRel(RelBuilder relBuilder, Aggregate oldAggregate, List<AggregateCall> newCalls)
relBuilder - Builder of relational expressions; at the top of its
stack is its inputoldAggregate - LogicalAggregate to clone.newCalls - New list of AggregateCallsprotected void newCalcRel(RelBuilder relBuilder, RelDataType rowType, List<RexNode> exprs)
relBuilder - Builder of relational expressions; at the top of its
stack is its inputrowType - The output row type of the original aggregate.exprs - The expressions to compute the original aggregate callsCopyright © 2012-2022 Apache Software Foundation. All Rights Reserved.