SnappySortMergeJoinExec

Instance Constructors

new SnappySortMergeJoinExec(_leftKeys: Seq[Expression], _rightKeys: Seq[Expression], _joinType: JoinType, _condition: Option[Expression], _left: SparkPlan, _right: SparkPlan, leftSizeInBytes: BigInt, rightSizeInBytes: BigInt)

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 canonicalized: SparkPlan

Attributes
protected
Definition Classes
QueryPlan
final def children: Seq[SparkPlan]

Definition Classes
BinaryExecNode → TreeNode
lazy val cleanArgs: Seq[Any]

Attributes
protected
Definition Classes
QueryPlan
def cleanExpression(e: Expression): Expression

Attributes
protected
Definition Classes
QueryPlan
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: Option[Expression]

Definition Classes
SortMergeJoinExec
lazy val constraints: ExpressionSet

Definition Classes
QueryPlan
final def consume(ctx: CodegenContext, outputVars: Seq[ExprCode], row: String): String

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

Definition Classes
TreeNode
def copy(leftKeys: Seq[Expression], rightKeys: Seq[Expression], joinType: JoinType, condition: Option[Expression], left: SparkPlan, right: SparkPlan, leftSizeInBytes: BigInt, rightSizeInBytes: BigInt): SnappySortMergeJoinExec
def copy(leftKeys: Seq[Expression] = leftKeys, rightKeys: Seq[Expression] = rightKeys, joinType: JoinType = joinType, condition: Option[Expression] = condition, left: SparkPlan = left, right: SparkPlan = right): SnappySortMergeJoinExec

Definition Classes
SnappySortMergeJoinExec → SortMergeJoinExec
def doConsume(ctx: CodegenContext, input: Seq[ExprCode], row: ExprCode): String

Definition Classes
CodegenSupport
def doExecute(): RDD[InternalRow]

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

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

Attributes
protected
Definition Classes
SparkPlan
def doProduce(ctx: CodegenContext): String

Definition Classes
SortMergeJoinExec → CodegenSupport
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def evaluateRequiredVariables(attributes: Seq[Attribute], variables: Seq[ExprCode], required: AttributeSet): String

Attributes
protected
Definition Classes
CodegenSupport
def evaluateVariables(variables: Seq[ExprCode]): String

Attributes
protected
Definition Classes
CodegenSupport
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): StringBuilder

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

Definition Classes
AnyRef → Any
def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
def getSubsetsAndIndices(partitioning: Partitioning, keys: Seq[Expression], child: SparkPlan): Seq[(Seq[Expression], Seq[Int])]

Optionally return result if partitioning is a subset of given join keys, and if so then return the subset as well as the indices of subset keys in the join keys (in order).
Optionally return result if partitioning is a subset of given join keys, and if so then return the subset as well as the indices of subset keys in the join keys (in order). Also unwraps aliases in the keys for matching against partitioning and returns a boolean indicating whether alias was unwrapped or not.

Attributes
protected
Definition Classes
SnappyJoinLike
def hashCode(): Int

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

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

Attributes
protected
Definition Classes
QueryPlan → TreeNode
def inputRDDs(): Seq[RDD[InternalRow]]

Definition Classes
SortMergeJoinExec → CodegenSupport
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
val joinType: JoinType

Definition Classes
SortMergeJoinExec
def jsonFields: List[JField]

Attributes
protected
Definition Classes
TreeNode
val left: SparkPlan

Definition Classes
SortMergeJoinExec → BinaryExecNode
val leftKeys: Seq[Expression]

Definition Classes
SortMergeJoinExec
val leftSizeInBytes: BigInt

Definition Classes
SnappySortMergeJoinExec → SnappyJoinLike
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): SnappySortMergeJoinExec.this.type

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

Attributes
protected
Definition Classes
TreeNode
def metadata: Map[String, String]

Definition Classes
SparkPlan
def metricTerm(ctx: CodegenContext, name: String): String

Definition Classes
CodegenSupport
lazy val metrics: Map[String, SQLMetric]

Definition Classes
SortMergeJoinExec → SparkPlan
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
def output: Seq[Attribute]

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

Definition Classes
SortMergeJoinExec → SparkPlan
def outputPartitioning: Partitioning

Definition Classes
SortMergeJoinExec → SparkPlan
def outputSet: AttributeSet

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

Definition Classes
TreeNode
var parent: CodegenSupport

Attributes
protected
Definition Classes
CodegenSupport
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
final def produce(ctx: CodegenContext, parent: CodegenSupport): String

Definition Classes
CodegenSupport
def producedAttributes: AttributeSet

Definition Classes
QueryPlan
def productArity: Int

Definition Classes
SnappySortMergeJoinExec → SortMergeJoinExec → Product
def productElement(n: Int): Any

Definition Classes
SnappySortMergeJoinExec → SortMergeJoinExec → Product
def references: AttributeSet

Definition Classes
QueryPlan
def requiredChildDistribution: Seq[Distribution]

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

Definition Classes
SortMergeJoinExec → SparkPlan
def resetMetrics(): Unit

Definition Classes
SparkPlan
val right: SparkPlan

Definition Classes
SortMergeJoinExec → BinaryExecNode
val rightKeys: Seq[Expression]

Definition Classes
SortMergeJoinExec
val rightSizeInBytes: BigInt

Definition Classes
SnappySortMergeJoinExec → SnappyJoinLike
def sameResult(plan: SparkPlan): Boolean

Definition Classes
QueryPlan
lazy val schema: StructType

Definition Classes
QueryPlan
def schemaString: String

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
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
val subexpressionEliminationEnabled: Boolean

Definition Classes
SparkPlan
def subqueries: Seq[SparkPlan]

Definition Classes
QueryPlan
def supportCodegen: Boolean

Definition Classes
SortMergeJoinExec → CodegenSupport
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]): SnappySortMergeJoinExec.this.type

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

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

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

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

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

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

Definition Classes
TreeNode
def treeString: String

Definition Classes
TreeNode
def usedInputs: AttributeSet

Definition Classes
CodegenSupport
def validConstraints: Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
def verboseString: String

Definition Classes
QueryPlan → 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 joins

class SnappySortMergeJoinExec extends SortMergeJoinExec with SnappyJoinLike

Instance Constructors

new SnappySortMergeJoinExec(_leftKeys: Seq[Expression], _rightKeys: Seq[Expression], _joinType: JoinType, _condition: Option[Expression], _left: SparkPlan, _right: SparkPlan, leftSizeInBytes: BigInt, rightSizeInBytes: BigInt)

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 canonicalized: SparkPlan

final def children: Seq[SparkPlan]

lazy val cleanArgs: Seq[Any]

def cleanExpression(e: Expression): Expression

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: Option[Expression]

lazy val constraints: ExpressionSet

final def consume(ctx: CodegenContext, outputVars: Seq[ExprCode], row: String): String

lazy val containsChild: Set[TreeNode[_]]

def copy(leftKeys: Seq[Expression], rightKeys: Seq[Expression], joinType: JoinType, condition: Option[Expression], left: SparkPlan, right: SparkPlan, leftSizeInBytes: BigInt, rightSizeInBytes: BigInt): SnappySortMergeJoinExec

def copy(leftKeys: Seq[Expression] = leftKeys, rightKeys: Seq[Expression] = rightKeys, joinType: JoinType = joinType, condition: Option[Expression] = condition, left: SparkPlan = left, right: SparkPlan = right): SnappySortMergeJoinExec

def doConsume(ctx: CodegenContext, input: Seq[ExprCode], row: ExprCode): String

def doExecute(): RDD[InternalRow]

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

def doPrepare(): Unit

def doProduce(ctx: CodegenContext): String

final def eq(arg0: AnyRef): Boolean

def evaluateRequiredVariables(attributes: Seq[Attribute], variables: Seq[ExprCode], required: AttributeSet): String

def evaluateVariables(variables: Seq[ExprCode]): String

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): StringBuilder

final def getClass(): Class[_]

def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

def getSubsetsAndIndices(partitioning: Partitioning, keys: Seq[Expression], child: SparkPlan): Seq[(Seq[Expression], Seq[Int])]

def hashCode(): Int

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def innerChildren: Seq[QueryPlan[_]]

def inputRDDs(): Seq[RDD[InternalRow]]

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

val joinType: JoinType

def jsonFields: List[JField]

val left: SparkPlan

val leftKeys: Seq[Expression]

val leftSizeInBytes: BigInt

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