public class AggregateReduceFunctionsRule extends RelOptRule
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.
| Modifier and Type | Field and Description |
|---|---|
static AggregateReduceFunctionsRule |
INSTANCE
The singleton.
|
description, operands| Modifier | Constructor and Description |
|---|---|
protected |
AggregateReduceFunctionsRule(RelOptRuleOperand operand) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
matches(RelOptRuleCall call)
Returns whether this rule could possibly match the given operands.
|
protected Aggregate |
newAggregateRel(Aggregate oldAggregate,
RelNode input,
List<AggregateCall> newCalls)
Do a shallow clone of oldAggRel and update aggCalls.
|
void |
onMatch(RelOptRuleCall ruleCall)
Receives notification about a rule match.
|
any, convert, convert, convertList, equals, equals, getOperand, getOperands, getOutConvention, getOutTrait, hashCode, none, operand, operand, operand, operand, operand, some, toString, unorderedpublic static final AggregateReduceFunctionsRule INSTANCE
protected AggregateReduceFunctionsRule(RelOptRuleOperand operand)
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>) to
register the expression.
onMatch in class RelOptRuleruleCall - Rule callRelOptRule.matches(RelOptRuleCall)protected Aggregate newAggregateRel(Aggregate oldAggregate, RelNode input, List<AggregateCall> newCalls)
oldAggregate - LogicalAggregate to clone.input - Input relational expressionnewCalls - New list of AggregateCallsCopyright © 2012–2015 The Apache Software Foundation. All rights reserved.