IntervalTreeJoinOptimChromosome

Instance Constructors

new IntervalTreeJoinOptimChromosome(left: SparkPlan, right: SparkPlan, condition: Seq[Expression], context: SparkSession, minOverlap: Int, maxGap: Int, useJoinOrder: Boolean)

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
lazy val allAttributes: AttributeSeq

Definition Classes
QueryPlan
def apply(number: Int): TreeNode[_]

Definition Classes
TreeNode
def argString: String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
lazy val buildKeyGenerator: InterpretedProjection
lazy val buildKeys: List[Expression]
lazy val buildPlan: SparkPlan
final lazy val canonicalized: SparkPlan

Definition Classes
QueryPlan
final def children: Seq[SparkPlan]

Definition Classes
BinaryExecNode → TreeNode
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[B](pf: PartialFunction[SparkPlan, B]): Seq[B]

Definition Classes
TreeNode
def collectFirst[B](pf: PartialFunction[SparkPlan, B]): Option[B]

Definition Classes
TreeNode
def collectLeaves(): Seq[SparkPlan]

Definition Classes
TreeNode
val condition: Seq[Expression]
def conf: SQLConf

Definition Classes
QueryPlan
lazy val containsChild: Set[TreeNode[_]]

Definition Classes
TreeNode
val context: SparkSession
def doCanonicalize(): SparkPlan

Attributes
protected
Definition Classes
QueryPlan
def doExecute(): RDD[InternalRow]

Attributes
protected
Definition Classes
IntervalTreeJoinOptimChromosome → SparkPlan
def doExecuteBroadcast[T](): Broadcast[T]

Attributes
protected[org.apache.spark.sql]
Definition Classes
SparkPlan
def doPrepare(): Unit

Attributes
protected
Definition Classes
SparkPlan
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def execute(): RDD[InternalRow]

Definition Classes
SparkPlan
final def executeBroadcast[T](): Broadcast[T]

Definition Classes
SparkPlan
def executeCollect(): Array[InternalRow]

Definition Classes
SparkPlan
def executeCollectPublic(): Array[Row]

Definition Classes
SparkPlan
final def executeQuery[T](query: ⇒ T): T

Attributes
protected
Definition Classes
SparkPlan
def executeTake(n: Int): Array[InternalRow]

Definition Classes
SparkPlan
def executeToIterator(): Iterator[InternalRow]

Definition Classes
SparkPlan
final def expressions: Seq[Expression]

Definition Classes
QueryPlan
def fastEquals(other: TreeNode[_]): Boolean

Definition Classes
TreeNode
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(f: (SparkPlan) ⇒ Boolean): Option[SparkPlan]

Definition Classes
TreeNode
def flatMap[A](f: (SparkPlan) ⇒ TraversableOnce[A]): Seq[A]

Definition Classes
TreeNode
def foreach(f: (SparkPlan) ⇒ Unit): Unit

Definition Classes
TreeNode
def foreachUp(f: (SparkPlan) ⇒ Unit): Unit

Definition Classes
TreeNode
def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder

Definition Classes
TreeNode
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
TreeNode → AnyRef → Any
def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean): Boolean

Attributes
protected
Definition Classes
Logging
def initializeLogIfNecessary(isInterpreter: Boolean): Unit

Attributes
protected
Definition Classes
Logging
def innerChildren: Seq[QueryPlan[_]]

Attributes
protected
Definition Classes
QueryPlan → TreeNode
def inputSet: AttributeSet

Definition Classes
QueryPlan
def isCanonicalizedPlan: Boolean

Attributes
protected
Definition Classes
QueryPlan
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
def jsonFields: List[JField]

Attributes
protected
Definition Classes
TreeNode
val left: SparkPlan

Definition Classes
IntervalTreeJoinOptimChromosome → BinaryExecNode
def log: Logger

Attributes
protected
Definition Classes
Logging
def logDebug(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logDebug(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logError(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logError(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logInfo(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logInfo(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logName: String

Attributes
protected
Definition Classes
Logging
def logTrace(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logTrace(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logWarning(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logWarning(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def longMetric(name: String): SQLMetric

Definition Classes
SparkPlan
def makeCopy(newArgs: Array[AnyRef]): SparkPlan

Definition Classes
SparkPlan → TreeNode
def map[A](f: (SparkPlan) ⇒ A): Seq[A]

Definition Classes
TreeNode
def mapChildren(f: (SparkPlan) ⇒ SparkPlan): SparkPlan

Definition Classes
TreeNode
def mapExpressions(f: (Expression) ⇒ Expression): IntervalTreeJoinOptimChromosome.this.type

Definition Classes
QueryPlan
def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

Attributes
protected
Definition Classes
TreeNode
val maxGap: Int
def metrics: Map[String, SQLMetric]

Definition Classes
SparkPlan
val minOverlap: Int
def missingInput: AttributeSet

Definition Classes
QueryPlan
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newMutableProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute], useSubexprElimination: Boolean): MutableProjection

Attributes
protected
Definition Classes
SparkPlan
def newNaturalAscendingOrdering(dataTypes: Seq[DataType]): Ordering[InternalRow]

Attributes
protected
Definition Classes
SparkPlan
def newOrdering(order: Seq[SortOrder], inputSchema: Seq[Attribute]): Ordering[InternalRow]

Attributes
protected
Definition Classes
SparkPlan
def newPredicate(expression: Expression, inputSchema: Seq[Attribute]): Predicate

Attributes
protected
Definition Classes
SparkPlan
def nodeName: String

Definition Classes
TreeNode
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def numberedTreeString: String

Definition Classes
TreeNode
val origin: Origin

Definition Classes
TreeNode
def otherCopyArgs: Seq[AnyRef]

Attributes
protected
Definition Classes
TreeNode
lazy val output: Seq[Attribute]

Definition Classes
IntervalTreeJoinOptimChromosome → QueryPlan
def outputOrdering: Seq[SortOrder]

Definition Classes
SparkPlan
def outputPartitioning: Partitioning

Definition Classes
SparkPlan
def outputSet: AttributeSet

Definition Classes
QueryPlan
def p(number: Int): SparkPlan

Definition Classes
TreeNode
final def prepare(): Unit

Definition Classes
SparkPlan
def prepareSubqueries(): Unit

Attributes
protected
Definition Classes
SparkPlan
def prettyJson: String

Definition Classes
TreeNode
def printSchema(): Unit

Definition Classes
QueryPlan
def producedAttributes: AttributeSet

Definition Classes
QueryPlan
def references: AttributeSet

Definition Classes
QueryPlan
def requiredChildDistribution: Seq[Distribution]

Definition Classes
SparkPlan
def requiredChildOrdering: Seq[Seq[SortOrder]]

Definition Classes
SparkPlan
def resetMetrics(): Unit

Definition Classes
SparkPlan
val right: SparkPlan

Definition Classes
IntervalTreeJoinOptimChromosome → BinaryExecNode
final def sameResult(other: SparkPlan): Boolean

Definition Classes
QueryPlan
lazy val schema: StructType

Definition Classes
QueryPlan
def schemaString: String

Definition Classes
QueryPlan
final def semanticHash(): Int

Definition Classes
QueryPlan
def simpleString: String

Definition Classes
QueryPlan → TreeNode
def sparkContext: SparkContext

Attributes
protected
Definition Classes
SparkPlan
final val sqlContext: SQLContext

Definition Classes
SparkPlan
def statePrefix: String

Attributes
protected
Definition Classes
QueryPlan
lazy val streamKeyGenerator: InterpretedProjection
lazy val streamedKeys: List[Expression]
lazy val streamedPlan: SparkPlan
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
val subexpressionEliminationEnabled: Boolean

Definition Classes
SparkPlan
def subqueries: Seq[SparkPlan]

Definition Classes
QueryPlan
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toJSON: String

Definition Classes
TreeNode
def toString(): String

Definition Classes
TreeNode → AnyRef → Any
def transform(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

Definition Classes
TreeNode
def transformAllExpressions(rule: PartialFunction[Expression, Expression]): IntervalTreeJoinOptimChromosome.this.type

Definition Classes
QueryPlan
def transformDown(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

Definition Classes
TreeNode
def transformExpressions(rule: PartialFunction[Expression, Expression]): IntervalTreeJoinOptimChromosome.this.type

Definition Classes
QueryPlan
def transformExpressionsDown(rule: PartialFunction[Expression, Expression]): IntervalTreeJoinOptimChromosome.this.type

Definition Classes
QueryPlan
def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): IntervalTreeJoinOptimChromosome.this.type

Definition Classes
QueryPlan
def transformUp(rule: PartialFunction[SparkPlan, SparkPlan]): SparkPlan

Definition Classes
TreeNode
def treeString(verbose: Boolean, addSuffix: Boolean): String

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
val useJoinOrder: Boolean
def verboseString: String

Definition Classes
QueryPlan → TreeNode
def verboseStringWithSuffix: String

Definition Classes
TreeNode
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( ... )
def waitForSubqueries(): Unit

Attributes
protected
Definition Classes
SparkPlan
def withNewChildren(newChildren: Seq[SparkPlan]): SparkPlan

Definition Classes
TreeNode

Related Doc: package IntervalTree

case class IntervalTreeJoinOptimChromosome(left: SparkPlan, right: SparkPlan, condition: Seq[Expression], context: SparkSession, minOverlap: Int, maxGap: Int, useJoinOrder: Boolean) extends SparkPlan with BinaryExecNode with Serializable with Product

Instance Constructors

new IntervalTreeJoinOptimChromosome(left: SparkPlan, right: SparkPlan, condition: Seq[Expression], context: SparkSession, minOverlap: Int, maxGap: Int, useJoinOrder: Boolean)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

lazy val allAttributes: AttributeSeq

def apply(number: Int): TreeNode[_]

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

lazy val buildKeyGenerator: InterpretedProjection

lazy val buildKeys: List[Expression]

lazy val buildPlan: SparkPlan

final lazy val canonicalized: SparkPlan

final def children: Seq[SparkPlan]

def clone(): AnyRef

def collect[B](pf: PartialFunction[SparkPlan, B]): Seq[B]

def collectFirst[B](pf: PartialFunction[SparkPlan, B]): Option[B]

def collectLeaves(): Seq[SparkPlan]

val condition: Seq[Expression]

def conf: SQLConf

lazy val containsChild: Set[TreeNode[_]]

val context: SparkSession

def doCanonicalize(): SparkPlan

def doExecute(): RDD[InternalRow]

def doExecuteBroadcast[T](): Broadcast[T]

def doPrepare(): Unit

final def eq(arg0: AnyRef): Boolean

final def execute(): RDD[InternalRow]

final def executeBroadcast[T](): Broadcast[T]

def executeCollect(): Array[InternalRow]

def executeCollectPublic(): Array[Row]

final def executeQuery[T](query: ⇒ T): T

def executeTake(n: Int): Array[InternalRow]

def executeToIterator(): Iterator[InternalRow]

final def expressions: Seq[Expression]

def fastEquals(other: TreeNode[_]): Boolean

def finalize(): Unit

def find(f: (SparkPlan) ⇒ Boolean): Option[SparkPlan]

def flatMap[A](f: (SparkPlan) ⇒ TraversableOnce[A]): Seq[A]

def foreach(f: (SparkPlan) ⇒ Unit): Unit

def foreachUp(f: (SparkPlan) ⇒ Unit): Unit

def generateTreeString(depth: Int, lastChildren: Seq[Boolean], builder: StringBuilder, verbose: Boolean, prefix: String, addSuffix: Boolean): StringBuilder

final def getClass(): Class[_]

def hashCode(): Int

def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean): Boolean

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def innerChildren: Seq[QueryPlan[_]]

def inputSet: AttributeSet

def isCanonicalizedPlan: Boolean

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

def jsonFields: List[JField]

val left: SparkPlan

def log: Logger

def logDebug(msg: ⇒ String, throwable: Throwable): Unit

def logDebug(msg: ⇒ String): Unit

def logError(msg: ⇒ String, throwable: Throwable): Unit

def logError(msg: ⇒ String): Unit

def logInfo(msg: ⇒ String, throwable: Throwable): Unit

def logInfo(msg: ⇒ String): Unit

def logName: String

def logTrace(msg: ⇒ String, throwable: Throwable): Unit

def logTrace(msg: ⇒ String): Unit

def logWarning(msg: ⇒ String, throwable: Throwable): Unit

def logWarning(msg: ⇒ String): Unit

def longMetric(name: String): SQLMetric

def makeCopy(newArgs: Array[AnyRef]): SparkPlan

def map[A](f: (SparkPlan) ⇒ A): Seq[A]

def mapChildren(f: (SparkPlan) ⇒ SparkPlan): SparkPlan

def mapExpressions(f: (Expression) ⇒ Expression): IntervalTreeJoinOptimChromosome.this.type

def mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

val maxGap: Int

def metrics: Map[String, SQLMetric]

val minOverlap: Int

def missingInput: AttributeSet