forked from apache/spark
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Factor out NormalizePlan to be later used in single-pass Analyzer tes…
…ting
- Loading branch information
1 parent
f9a5de4
commit 8e72931
Showing
2 changed files
with
132 additions
and
90 deletions.
There are no files selected for viewing
127 changes: 127 additions & 0 deletions
127
sql/catalyst/src/main/scala/org/apache/spark/sql/catalyst/plans/NormalizePlan.scala
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,127 @@ | ||
| /* | ||
| * 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.plans | ||
|
|
||
| import org.apache.spark.sql.catalyst.analysis.GetViewColumnByNameAndOrdinal | ||
| import org.apache.spark.sql.catalyst.expressions._ | ||
| import org.apache.spark.sql.catalyst.expressions.aggregate.AggregateExpression | ||
| import org.apache.spark.sql.catalyst.plans.logical._ | ||
|
|
||
| object NormalizePlan extends PredicateHelper { | ||
| def apply(plan: LogicalPlan): LogicalPlan = | ||
| normalizePlan(normalizeExprIds(plan)) | ||
|
|
||
| /** | ||
| * Since attribute references are given globally unique ids during analysis, | ||
| * we must normalize them to check if two different queries are identical. | ||
| */ | ||
| def normalizeExprIds(plan: LogicalPlan): LogicalPlan = { | ||
| plan transformAllExpressions { | ||
| case s: ScalarSubquery => | ||
| s.copy(plan = normalizeExprIds(s.plan), exprId = ExprId(0)) | ||
| case s: LateralSubquery => | ||
| s.copy(plan = normalizeExprIds(s.plan), exprId = ExprId(0)) | ||
| case e: Exists => | ||
| e.copy(plan = normalizeExprIds(e.plan), exprId = ExprId(0)) | ||
| case l: ListQuery => | ||
| l.copy(plan = normalizeExprIds(l.plan), exprId = ExprId(0)) | ||
| case a: AttributeReference => | ||
| AttributeReference(a.name, a.dataType, a.nullable)(exprId = ExprId(0)) | ||
| case OuterReference(a: AttributeReference) => | ||
| OuterReference(AttributeReference(a.name, a.dataType, a.nullable)(exprId = ExprId(0))) | ||
| case a: Alias => | ||
| Alias(a.child, a.name)(exprId = ExprId(0)) | ||
| case OuterReference(a: Alias) => | ||
| OuterReference(Alias(a.child, a.name)(exprId = ExprId(0))) | ||
| case ae: AggregateExpression => | ||
| ae.copy(resultId = ExprId(0)) | ||
| case lv: NamedLambdaVariable => | ||
| lv.copy(exprId = ExprId(0), value = null) | ||
| case udf: PythonUDF => | ||
| udf.copy(resultId = ExprId(0)) | ||
| case udaf: PythonUDAF => | ||
| udaf.copy(resultId = ExprId(0)) | ||
| case a: FunctionTableSubqueryArgumentExpression => | ||
| a.copy(plan = normalizeExprIds(a.plan), exprId = ExprId(0)) | ||
| } | ||
| } | ||
|
|
||
| /** | ||
| * Normalizes plans: | ||
| * - Filter the filter conditions that appear in a plan. For instance, | ||
| * ((expr 1 && expr 2) && expr 3), (expr 1 && expr 2 && expr 3), (expr 3 && (expr 1 && expr 2) | ||
| * etc., will all now be equivalent. | ||
| * - Sample the seed will replaced by 0L. | ||
| * - Join conditions will be resorted by hashCode. | ||
| */ | ||
| def normalizePlan(plan: LogicalPlan): LogicalPlan = { | ||
| plan transform { | ||
| case Filter(condition: Expression, child: LogicalPlan) => | ||
| Filter( | ||
| splitConjunctivePredicates(condition) | ||
| .map(rewriteBinaryComparison) | ||
| .sortBy(_.hashCode()) | ||
| .reduce(And), | ||
| child | ||
| ) | ||
| case sample: Sample => | ||
| sample.copy(seed = 0L) | ||
| case Join(left, right, joinType, condition, hint) if condition.isDefined => | ||
| val newJoinType = joinType match { | ||
| case ExistenceJoin(a: Attribute) => | ||
| val newAttr = AttributeReference(a.name, a.dataType, a.nullable)(exprId = ExprId(0)) | ||
| ExistenceJoin(newAttr) | ||
| case other => other | ||
| } | ||
|
|
||
| val newCondition = | ||
| splitConjunctivePredicates(condition.get) | ||
| .map(rewriteBinaryComparison) | ||
| .sortBy(_.hashCode()) | ||
| .reduce(And) | ||
| Join(left, right, newJoinType, Some(newCondition), hint) | ||
| case Project(projectList, child) => | ||
| val projList = projectList | ||
| .map { e => | ||
| e.transformUp { | ||
| case g: GetViewColumnByNameAndOrdinal => g.copy(viewDDL = None) | ||
| } | ||
| } | ||
| .asInstanceOf[Seq[NamedExpression]] | ||
| Project(projList, child) | ||
| case c: KeepAnalyzedQuery => c.storeAnalyzedQuery() | ||
| } | ||
| } | ||
|
|
||
| /** | ||
| * Rewrite [[BinaryComparison]] operator to keep order. The following cases will be | ||
| * equivalent: | ||
| * 1. (a = b), (b = a); | ||
| * 2. (a <=> b), (b <=> a). | ||
| * 3. (a > b), (b < a) | ||
| */ | ||
| private def rewriteBinaryComparison(condition: Expression): Expression = condition match { | ||
| case EqualTo(l, r) => Seq(l, r).sortBy(_.hashCode()).reduce(EqualTo) | ||
| case EqualNullSafe(l, r) => Seq(l, r).sortBy(_.hashCode()).reduce(EqualNullSafe) | ||
| case GreaterThan(l, r) if l.hashCode() > r.hashCode() => LessThan(r, l) | ||
| case LessThan(l, r) if l.hashCode() > r.hashCode() => GreaterThan(r, l) | ||
| case GreaterThanOrEqual(l, r) if l.hashCode() > r.hashCode() => LessThanOrEqual(r, l) | ||
| case LessThanOrEqual(l, r) if l.hashCode() > r.hashCode() => GreaterThanOrEqual(r, l) | ||
| case _ => condition // Don't reorder. | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters