Skip to content
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
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
Original file line number Diff line number Diff line change
Expand Up @@ -363,7 +363,7 @@ object EliminateDistinct extends Rule[LogicalPlan] {
ae.copy(isDistinct = false)
}

private def isDuplicateAgnostic(af: AggregateFunction): Boolean = af match {
def isDuplicateAgnostic(af: AggregateFunction): Boolean = af match {
case _: Max => true
case _: Min => true
case _: BitAndAgg => true
Expand Down Expand Up @@ -506,47 +506,6 @@ object RemoveRedundantAliases extends Rule[LogicalPlan] {
def apply(plan: LogicalPlan): LogicalPlan = removeRedundantAliases(plan, AttributeSet.empty)
}

/**
* Remove redundant aggregates from a query plan. A redundant aggregate is an aggregate whose
* only goal is to keep distinct values, while its parent aggregate would ignore duplicate values.
*/
object RemoveRedundantAggregates extends Rule[LogicalPlan] with AliasHelper {
def apply(plan: LogicalPlan): LogicalPlan = plan.transformUpWithPruning(
_.containsPattern(AGGREGATE), ruleId) {
case upper @ Aggregate(_, _, lower: Aggregate) if lowerIsRedundant(upper, lower) =>
val aliasMap = getAliasMap(lower)

val newAggregate = upper.copy(
child = lower.child,
groupingExpressions = upper.groupingExpressions.map(replaceAlias(_, aliasMap)),
aggregateExpressions = upper.aggregateExpressions.map(
replaceAliasButKeepName(_, aliasMap))
)

// We might have introduces non-deterministic grouping expression
if (newAggregate.groupingExpressions.exists(!_.deterministic)) {
PullOutNondeterministic.applyLocally.applyOrElse(newAggregate, identity[LogicalPlan])
} else {
newAggregate
}
}

private def lowerIsRedundant(upper: Aggregate, lower: Aggregate): Boolean = {
val upperHasNoAggregateExpressions =
!upper.aggregateExpressions.exists(AggregateExpression.containsAggregate)

lazy val upperRefsOnlyDeterministicNonAgg = upper.references.subsetOf(AttributeSet(
lower
.aggregateExpressions
.filter(_.deterministic)
.filterNot(AggregateExpression.containsAggregate)
.map(_.toAttribute)
))

upperHasNoAggregateExpressions && upperRefsOnlyDeterministicNonAgg
}
}

/**
* Remove no-op operators from the query plan that do not make any modifications.
*/
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
/*
* 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.spark.sql.catalyst.optimizer

import org.apache.spark.sql.catalyst.analysis.PullOutNondeterministic
import org.apache.spark.sql.catalyst.expressions.{AliasHelper, AttributeSet}
import org.apache.spark.sql.catalyst.expressions.aggregate.AggregateExpression
import org.apache.spark.sql.catalyst.plans.logical.{Aggregate, LogicalPlan}
import org.apache.spark.sql.catalyst.rules.Rule
import org.apache.spark.sql.catalyst.trees.TreePattern.AGGREGATE

/**
* Remove redundant aggregates from a query plan. A redundant aggregate is an aggregate whose
* only goal is to keep distinct values, while its parent aggregate would ignore duplicate values.
*/
object RemoveRedundantAggregates extends Rule[LogicalPlan] with AliasHelper {
def apply(plan: LogicalPlan): LogicalPlan = plan.transformUpWithPruning(
_.containsPattern(AGGREGATE), ruleId) {
case upper @ Aggregate(_, _, lower: Aggregate) if isLowerRedundant(upper, lower) =>
val aliasMap = getAliasMap(lower)

val newAggregate = upper.copy(
child = lower.child,
groupingExpressions = upper.groupingExpressions.map(replaceAlias(_, aliasMap)),
aggregateExpressions = upper.aggregateExpressions.map(
replaceAliasButKeepName(_, aliasMap))
)

// We might have introduces non-deterministic grouping expression
if (newAggregate.groupingExpressions.exists(!_.deterministic)) {
PullOutNondeterministic.applyLocally.applyOrElse(newAggregate, identity[LogicalPlan])
} else {
newAggregate
}
}

private def isLowerRedundant(upper: Aggregate, lower: Aggregate): Boolean = {
val upperHasNoDuplicateSensitiveAgg = upper
.aggregateExpressions
.forall(expr => expr.find {
case ae: AggregateExpression => !EliminateDistinct.isDuplicateAgnostic(ae.aggregateFunction)
case e => AggregateExpression.isAggregate(e)
}.isEmpty)
Comment on lines +53 to +58
Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This is only behaviour change


lazy val upperRefsOnlyDeterministicNonAgg = upper.references.subsetOf(AttributeSet(
lower
.aggregateExpressions
.filter(_.deterministic)
.filterNot(AggregateExpression.containsAggregate)
.map(_.toAttribute)
))

upperHasNoDuplicateSensitiveAgg && upperRefsOnlyDeterministicNonAgg
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -126,7 +126,7 @@ class RemoveRedundantAggregatesSuite extends PlanTest {
comparePlans(optimized, expected)
}

test("Keep non-redundant aggregate - upper has agg expression") {
test("Keep non-redundant aggregate - upper has duplicate sensitive agg expression") {
val relation = LocalRelation('a.int, 'b.int)
for (agg <- aggregates('b)) {
val query = relation
Expand All @@ -139,6 +139,20 @@ class RemoveRedundantAggregatesSuite extends PlanTest {
}
}

test("Remove redundant aggregate - upper has duplicate agnostic agg expression") {
val relation = LocalRelation('a.int, 'b.int)
val query = relation
.groupBy('a, 'b)('a, 'b)
// The max does not change if there are duplicate values
.groupBy('a)('a, max('b))
.analyze
val expected = relation
.groupBy('a)('a, max('b))
.analyze
val optimized = Optimize.execute(query)
comparePlans(optimized, expected)
}

test("Keep non-redundant aggregate - upper references agg expression") {
val relation = LocalRelation('a.int, 'b.int)
for (agg <- aggregates('b)) {
Expand Down