object JoinReorderDPFilters extends PredicateHelper
Implements optional filters to reduce the search space for join enumeration.
1) Star-join filters: Plan star-joins together since they are assumed to have an optimal execution based on their RI relationship. 2) Cartesian products: Defer their planning later in the graph to avoid large intermediate results (expanding joins, in general). 3) Composite inners: Don't generate "bushy tree" plans to avoid materializing intermediate results.
Filters (2) and (3) are not implemented.
- Alphabetic
- By Inheritance
- JoinReorderDPFilters
- PredicateHelper
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
buildJoinGraphInfo(conf: SQLConf, items: Seq[LogicalPlan], conditions: Set[Expression], itemIndex: Seq[(LogicalPlan, Int)]): Option[JoinGraphInfo]
Builds join graph information to be used by the filtering strategies.
Builds join graph information to be used by the filtering strategies. Currently, it builds the sets of star/non-star joins. It can be extended with the sets of connected/unconnected joins, which can be used to filter Cartesian products.
-
def
canEvaluate(expr: Expression, plan: LogicalPlan): Boolean
Returns true if
exprcan be evaluated using only the output ofplan.Returns true if
exprcan be evaluated using only the output ofplan. This method can be used to determine when it is acceptable to move expression evaluation within a query plan.For example consider a join between two relations R(a, b) and S(c, d).
-
canEvaluate(EqualTo(a,b), R)returnstrue-canEvaluate(EqualTo(a,c), R)returnsfalse-canEvaluate(Literal(1), R)returnstrueas literals CAN be evaluated on any plan- Attributes
- protected
- Definition Classes
- PredicateHelper
-
def
canEvaluateWithinJoin(expr: Expression): Boolean
Returns true iff
exprcould be evaluated as a condition within join.Returns true iff
exprcould be evaluated as a condition within join.- Attributes
- protected
- Definition Classes
- PredicateHelper
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
findExpressionAndTrackLineageDown(exp: Expression, plan: LogicalPlan): Option[(Expression, LogicalPlan)]
Find the origin of where the input references of expression exp were scanned in the tree of plan, and if they originate from a single leaf node.
Find the origin of where the input references of expression exp were scanned in the tree of plan, and if they originate from a single leaf node. Returns optional tuple with Expression, undoing any projections and aliasing that has been done along the way from plan to origin, and the origin LeafNode plan from which all the exp
- Definition Classes
- PredicateHelper
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
replaceAlias(condition: Expression, aliases: AttributeMap[Expression]): Expression
- Attributes
- protected
- Definition Classes
- PredicateHelper
-
def
splitConjunctivePredicates(condition: Expression): Seq[Expression]
- Attributes
- protected
- Definition Classes
- PredicateHelper
-
def
splitDisjunctivePredicates(condition: Expression): Seq[Expression]
- Attributes
- protected
- Definition Classes
- PredicateHelper
-
def
starJoinFilter(oneSideJoinPlan: Set[Int], otherSideJoinPlan: Set[Int], filters: JoinGraphInfo): Boolean
Applies the star-join filter that eliminates join combinations among star and non-star tables until the star join is built.
Applies the star-join filter that eliminates join combinations among star and non-star tables until the star join is built.
Given the oneSideJoinPlan/otherSideJoinPlan, which represent all the plan permutations generated by the DP join enumeration, and the star/non-star plans, the following plan combinations are allowed: 1. (oneSideJoinPlan U otherSideJoinPlan) is a subset of star-join 2. star-join is a subset of (oneSideJoinPlan U otherSideJoinPlan) 3. (oneSideJoinPlan U otherSideJoinPlan) is a subset of non star-join
It assumes the sets are disjoint.
Example query graph:
t1 d1 - t2 - t3 \ / f1 | d2
star: {d1, f1, d2} non-star: {t2, t1, t3}
level 0: (f1 ), (d2 ), (t3 ), (d1 ), (t1 ), (t2 ) level 1: {t3 t2 }, {f1 d2 }, {f1 d1 } level 2: {d2 f1 d1 } level 3: {t1 d1 f1 d2 }, {t2 d1 f1 d2 } level 4: {d1 t2 f1 t1 d2 }, {d1 t3 t2 f1 d2 } level 5: {d1 t3 t2 f1 t1 d2 }
- oneSideJoinPlan
One side of the join represented as a set of plan ids.
- otherSideJoinPlan
The other side of the join represented as a set of plan ids.
- filters
Star and non-star plans represented as sets of plan ids
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()