SortMergeJoin

Instance Constructors

new SortMergeJoin(leftKeys: Seq[Expression], rightKeys: Seq[Expression], left: SparkPlan, right: SparkPlan)

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def apply(number: Int): SparkPlan

Definition Classes
TreeNode
def argString: String

Definition Classes
TreeNode
def asCode: String

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
def children: Seq[SparkPlan]

Definition Classes
BinaryNode
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val codegenEnabled: Boolean

Definition Classes
SparkPlan
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 doExecute(): RDD[Row]

Overridden by concrete implementations of SparkPlan.
Overridden by concrete implementations of SparkPlan. Produces the result of the query as an RDD[Row]

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

Definition Classes
AnyRef
final def execute(): RDD[catalyst.expressions.Row]

Returns the result of this query as an RDD[Row] by delegating to doExecute after adding query plan information to created RDDs for visualization.
Returns the result of this query as an RDD[Row] by delegating to doExecute after adding query plan information to created RDDs for visualization. Concrete implementations of SparkPlan should override doExecute instead.

Definition Classes
SparkPlan
def executeCollect(): Array[catalyst.expressions.Row]

Runs this query returning the result as an array.
Runs this query returning the result as an array.

Definition Classes
SparkPlan
def executeTake(n: Int): Array[catalyst.expressions.Row]

Runs this query returning the first n rows as an array.
Runs this query returning the first n rows as an array.
This is modeled after RDD.take but never runs any job locally on the driver.

Definition Classes
SparkPlan
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, builder: StringBuilder): StringBuilder

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

Definition Classes
AnyRef → Any
def getNodeNumbered(number: MutableInt): SparkPlan

Attributes
protected
Definition Classes
TreeNode
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
val left: SparkPlan

Definition Classes
SortMergeJoin → BinaryNode
lazy val leftKeyGenerator: Projection

Attributes
protected
val leftKeys: Seq[Expression]
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 makeCopy(newArgs: Array[AnyRef]): SortMergeJoin.this.type

Overridden make copy also propogates sqlContext to copied plan.
Overridden make copy also propogates sqlContext to copied plan.

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

Definition Classes
TreeNode
def mapChildren(f: (SparkPlan) ⇒ SparkPlan): SortMergeJoin.this.type

Definition Classes
TreeNode
def missingInput: AttributeSet

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

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

Attributes
protected
Definition Classes
SparkPlan
def newOrdering(order: Seq[SortOrder], inputSchema: Seq[Attribute]): Ordering[catalyst.expressions.Row]

Attributes
protected
Definition Classes
SparkPlan
def newPredicate(expression: Expression, inputSchema: Seq[Attribute]): (catalyst.expressions.Row) ⇒ Boolean

Attributes
protected
Definition Classes
SparkPlan
def newProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute]): Projection

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
SortMergeJoin → QueryPlan
def outputOrdering: Seq[SortOrder]

Specifies how data is ordered in each partition.
Specifies how data is ordered in each partition.

Definition Classes
SortMergeJoin → SparkPlan
def outputPartitioning: Partitioning

Specifies how data is partitioned across different nodes in the cluster.
Specifies how data is partitioned across different nodes in the cluster.

Definition Classes
SortMergeJoin → SparkPlan
def outputSet: AttributeSet

Definition Classes
QueryPlan
def printSchema(): Unit

Definition Classes
QueryPlan
def references: AttributeSet

Definition Classes
QueryPlan
def requiredChildDistribution: Seq[Distribution]

Specifies any partition requirements on the input data for this operator.
Specifies any partition requirements on the input data for this operator.

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

Specifies sort order for each partition requirements on the input data for this operator.
Specifies sort order for each partition requirements on the input data for this operator.

Definition Classes
SortMergeJoin → SparkPlan
val right: SparkPlan

Definition Classes
SortMergeJoin → BinaryNode
lazy val rightKeyGenerator: Projection

Attributes
protected
val rightKeys: Seq[Expression]
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

A handle to the SQL Context that was used to create this plan.
A handle to the SQL Context that was used to create this plan. Since many operators need access to the sqlContext for RDD operations or configuration this field is automatically populated by the query planning infrastructure.

Attributes
protected[org.apache.spark]
Definition Classes
SparkPlan
def statePrefix: String

Attributes
protected
Definition Classes
QueryPlan
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

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

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

Definition Classes
QueryPlan
def transformChildrenDown(rule: PartialFunction[SparkPlan, SparkPlan]): SortMergeJoin.this.type

Definition Classes
TreeNode
def transformChildrenUp(rule: PartialFunction[SparkPlan, SparkPlan]): SortMergeJoin.this.type

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

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

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

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

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

Definition Classes
TreeNode
def treeString: 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 withNewChildren(newChildren: Seq[SparkPlan]): SortMergeJoin.this.type

Definition Classes
TreeNode

case class SortMergeJoin(leftKeys: Seq[Expression], rightKeys: Seq[Expression], left: SparkPlan, right: SparkPlan) extends SparkPlan with BinaryNode with Product with Serializable

Instance Constructors

new SortMergeJoin(leftKeys: Seq[Expression], rightKeys: Seq[Expression], left: SparkPlan, right: SparkPlan)

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def apply(number: Int): SparkPlan

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

def children: Seq[SparkPlan]

def clone(): AnyRef

val codegenEnabled: Boolean

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

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

def doExecute(): RDD[Row]

final def eq(arg0: AnyRef): Boolean

final def execute(): RDD[catalyst.expressions.Row]

def executeCollect(): Array[catalyst.expressions.Row]

def executeTake(n: Int): Array[catalyst.expressions.Row]

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

final def getClass(): Class[_]

def getNodeNumbered(number: MutableInt): SparkPlan

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

val left: SparkPlan

lazy val leftKeyGenerator: Projection

val leftKeys: Seq[Expression]

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 makeCopy(newArgs: Array[AnyRef]): SortMergeJoin.this.type

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

def mapChildren(f: (SparkPlan) ⇒ SparkPlan): SortMergeJoin.this.type

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

def newMutableProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute]): () ⇒ MutableProjection

def newOrdering(order: Seq[SortOrder], inputSchema: Seq[Attribute]): Ordering[catalyst.expressions.Row]

def newPredicate(expression: Expression, inputSchema: Seq[Attribute]): (catalyst.expressions.Row) ⇒ Boolean

def newProjection(expressions: Seq[Expression], inputSchema: Seq[Attribute]): Projection

def nodeName: String

final def notify(): Unit

final def notifyAll(): Unit

def numberedTreeString: String

val origin: Origin

def otherCopyArgs: Seq[AnyRef]

def output: Seq[Attribute]

def outputOrdering: Seq[SortOrder]

def outputPartitioning: Partitioning

def outputSet: AttributeSet

def printSchema(): Unit

def references: AttributeSet

def requiredChildDistribution: Seq[Distribution]

def requiredChildOrdering: Seq[Seq[SortOrder]]

val right: SparkPlan

lazy val rightKeyGenerator: Projection

val rightKeys: Seq[Expression]

lazy val schema: StructType

def schemaString: String