forked from apache/flink
-
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.
[FLINK-12487] [table-planner-blink] Introduce planner rules to rewrit…
…e expression and merge calc This closes apache#8411
- Loading branch information
Showing
20 changed files
with
1,760 additions
and
152 deletions.
There are no files selected for viewing
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
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
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
187 changes: 187 additions & 0 deletions
187
...ink/src/main/scala/org/apache/flink/table/plan/rules/logical/ConvertToNotInOrInRule.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,187 @@ | ||
| /* | ||
| * 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:https://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.flink.table.plan.rules.logical | ||
|
|
||
| import org.apache.flink.table.`type`.InternalTypes | ||
| import org.apache.flink.table.calcite.FlinkTypeFactory | ||
|
|
||
| import org.apache.calcite.plan.RelOptRule.{any, operand} | ||
| import org.apache.calcite.plan.{RelOptRule, RelOptRuleCall, RelOptUtil} | ||
| import org.apache.calcite.rel.core.Filter | ||
| import org.apache.calcite.rex.{RexCall, RexLiteral, RexNode} | ||
| import org.apache.calcite.sql.SqlBinaryOperator | ||
| import org.apache.calcite.sql.fun.SqlStdOperatorTable.{AND, EQUALS, IN, NOT_EQUALS, NOT_IN, OR} | ||
| import org.apache.calcite.tools.RelBuilder | ||
|
|
||
| import scala.collection.JavaConversions._ | ||
| import scala.collection.mutable | ||
|
|
||
| /** | ||
| * Rule for converting a cascade of predicates to [[IN]] or [[NOT_IN]]. | ||
| * | ||
| * For example, | ||
| * 1. convert predicate: (x = 1 OR x = 2 OR x = 3 OR x = 4) AND y = 5 | ||
| * to predicate: x IN (1, 2, 3, 4) AND y = 5. | ||
| * 2. convert predicate: (x <> 1 AND x <> 2 AND x <> 3 AND x <> 4) AND y = 5 | ||
| * to predicate: x NOT IN (1, 2, 3, 4) AND y = 5. | ||
| */ | ||
| class ConvertToNotInOrInRule | ||
| extends RelOptRule( | ||
| operand(classOf[Filter], any), | ||
| "ConvertToNotInOrInRule") { | ||
|
|
||
| // these threshold values are set by OptimizableHashSet benchmark test on different type. | ||
| // threshold for non-float and non-double type | ||
| private val THRESHOLD: Int = 4 | ||
| // threshold for float and double type | ||
| private val FRACTIONAL_THRESHOLD: Int = 20 | ||
|
|
||
| override def onMatch(call: RelOptRuleCall): Unit = { | ||
| val filter: Filter = call.rel(0) | ||
| val condition = filter.getCondition | ||
|
|
||
| // convert equal expression connected by OR to IN | ||
| val inExpr = convertToNotInOrIn(call.builder(), condition, IN) | ||
| // convert not-equal expression connected by AND to NOT_IN | ||
| val notInExpr = convertToNotInOrIn(call.builder(), inExpr.getOrElse(condition), NOT_IN) | ||
|
|
||
| notInExpr match { | ||
| case Some(expr) => | ||
| val newFilter = filter.copy(filter.getTraitSet, filter.getInput, expr) | ||
| call.transformTo(newFilter) | ||
| case _ => | ||
| // check IN conversion if NOT_IN conversion is fail | ||
| inExpr match { | ||
| case Some(expr) => | ||
| val newFilter = filter.copy(filter.getTraitSet, filter.getInput, expr) | ||
| call.transformTo(newFilter) | ||
| case _ => // do nothing | ||
| } | ||
| } | ||
| } | ||
|
|
||
| /** | ||
| * Returns a condition decomposed by [[AND]] or [[OR]]. | ||
| */ | ||
| private def decomposedBy(rex: RexNode, operator: SqlBinaryOperator): Seq[RexNode] = { | ||
| operator match { | ||
| case AND => RelOptUtil.conjunctions(rex) | ||
| case OR => RelOptUtil.disjunctions(rex) | ||
| } | ||
| } | ||
|
|
||
| /** | ||
| * Convert a cascade predicates to [[IN]] or [[NOT_IN]]. | ||
| * | ||
| * @param builder The [[RelBuilder]] to build the [[RexNode]]. | ||
| * @param rex The predicates to be converted. | ||
| * @return The converted predicates. | ||
| */ | ||
| private def convertToNotInOrIn( | ||
| builder: RelBuilder, | ||
| rex: RexNode, | ||
| toOperator: SqlBinaryOperator): Option[RexNode] = { | ||
|
|
||
| // For example, when convert to [[IN]], fromOperator is [[EQUALS]]. | ||
| // We convert a cascade of [[EQUALS]] to [[IN]]. | ||
| // A connect operator is used to connect the fromOperator. | ||
| // A composed operator may contains sub [[IN]] or [[NOT_IN]]. | ||
| val (fromOperator, connectOperator, composedOperator) = toOperator match { | ||
| case IN => (EQUALS, OR, AND) | ||
| case NOT_IN => (NOT_EQUALS, AND, OR) | ||
| } | ||
|
|
||
| val decomposed = decomposedBy(rex, connectOperator) | ||
| val combineMap = new mutable.HashMap[String, mutable.ListBuffer[RexCall]] | ||
| val rexBuffer = new mutable.ArrayBuffer[RexNode] | ||
| var beenConverted = false | ||
|
|
||
| // traverse decomposed predicates | ||
| decomposed.foreach { | ||
| case call: RexCall => | ||
| call.getOperator match { | ||
| // put same predicates into combine map | ||
| case `fromOperator` => | ||
| (call.operands(0), call.operands(1)) match { | ||
| case (ref, _: RexLiteral) => | ||
| combineMap.getOrElseUpdate(ref.toString, mutable.ListBuffer[RexCall]()) += call | ||
| case (l: RexLiteral, ref) => | ||
| combineMap.getOrElseUpdate(ref.toString, mutable.ListBuffer[RexCall]()) += | ||
| call.clone(call.getType, List(ref, l)) | ||
| case _ => rexBuffer += call | ||
| } | ||
|
|
||
| // process sub predicates | ||
| case `composedOperator` => | ||
| val newRex = decomposedBy(call, composedOperator).map { r => | ||
| convertToNotInOrIn(builder, r, toOperator) match { | ||
| case Some(ex) => | ||
| beenConverted = true | ||
| ex | ||
| case None => r | ||
| } | ||
| } | ||
| composedOperator match { | ||
| case AND => rexBuffer += builder.and(newRex) | ||
| case OR => rexBuffer += builder.or(newRex) | ||
| } | ||
|
|
||
| case _ => rexBuffer += call | ||
| } | ||
|
|
||
| case rex => rexBuffer += rex | ||
| } | ||
|
|
||
| combineMap.values.foreach { list => | ||
| if (needConvert(list.toList)) { | ||
| val inputRef = list.head.getOperands.head | ||
| val values = list.map(_.getOperands.last) | ||
| rexBuffer += builder.getRexBuilder.makeCall(toOperator, List(inputRef) ++ values) | ||
| beenConverted = true | ||
| } else { | ||
| connectOperator match { | ||
| case AND => rexBuffer += builder.and(list) | ||
| case OR => rexBuffer += builder.or(list) | ||
| } | ||
| } | ||
| } | ||
|
|
||
| if (beenConverted) { | ||
| // return result if has been converted | ||
| connectOperator match { | ||
| case AND => Some(builder.and(rexBuffer)) | ||
| case OR => Some(builder.or(rexBuffer)) | ||
| } | ||
| } else { | ||
| None | ||
| } | ||
| } | ||
|
|
||
| private def needConvert(rexNodes: List[RexCall]): Boolean = { | ||
| val inputRef = rexNodes.head.getOperands.head | ||
| FlinkTypeFactory.toInternalType(inputRef.getType) match { | ||
| case InternalTypes.FLOAT | InternalTypes.DOUBLE => rexNodes.size >= FRACTIONAL_THRESHOLD | ||
| case _ => rexNodes.size >= THRESHOLD | ||
| } | ||
| } | ||
| } | ||
|
|
||
| object ConvertToNotInOrInRule { | ||
| val INSTANCE = new ConvertToNotInOrInRule | ||
| } |
Oops, something went wrong.