InsertIntoHiveTable

Instance Constructors

new InsertIntoHiveTable(table: MetastoreRelation, partition: Map[String, Option[String]], child: SparkPlan, overwrite: Boolean, ifNotExists: Boolean)
table
the logical plan representing the table. In the future this should be a org.apache.spark.sql.catalyst.catalog.CatalogTable once we converge Hive tables and data source tables.
partition
a map from the partition key to the partition value (optional). If the partition value is optional, dynamic partition insert will be performed. As an example, INSERT INTO tbl PARTITION (a=1, b=2) AS ... would have
```
Map('a' -> Some('1'), 'b' -> Some('2'))
```
and INSERT INTO tbl PARTITION (a=1, b) AS ... would have
```
Map('a' -> Some('1'), 'b' -> None)
```
.
child
the logical plan representing data to write to.
overwrite
overwrite existing table or partitions.
ifNotExists
If true, only write if the table or partition does not exist.

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
val child: SparkPlan

the logical plan representing data to write to.
the logical plan representing data to write to.

Definition Classes
InsertIntoHiveTable → UnaryExecNode
final def children: Seq[SparkPlan]

Definition Classes
UnaryExecNode → 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
lazy val constraints: ExpressionSet

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

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

Attributes
protected
Definition Classes
InsertIntoHiveTable → 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
InsertIntoHiveTable → 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 getExtTmpPathRelTo(path: Path, hadoopConf: Configuration): Path
def getExternalTmpPath(path: Path, hadoopConf: Configuration): Path
def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
val hadoopConf: Configuration
def hashCode(): Int

Definition Classes
TreeNode → AnyRef → Any
val ifNotExists: Boolean

If true, only write if the table or partition does not exist.
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
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
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 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 metrics: Map[String, SQLMetric]

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

Definition Classes
SparkPlan
def outputPartitioning: Partitioning

Definition Classes
InsertIntoHiveTable → SparkPlan
def outputSet: AttributeSet

Definition Classes
QueryPlan
val overwrite: Boolean

overwrite existing table or partitions.
def p(number: Int): SparkPlan

Definition Classes
TreeNode
val partition: Map[String, Option[String]]

a map from the partition key to the partition value (optional).
a map from the partition key to the partition value (optional). If the partition value is optional, dynamic partition insert will be performed. As an example, INSERT INTO tbl PARTITION (a=1, b=2) AS ... would have
```
Map('a' -> Some('1'), 'b' -> Some('2'))
```
and INSERT INTO tbl PARTITION (a=1, b) AS ... would have
```
Map('a' -> Some('1'), 'b' -> None)
```
.
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
def sameResult(plan: SparkPlan): Boolean

Definition Classes
QueryPlan
lazy val schema: StructType

Definition Classes
QueryPlan
def schemaString: String

Definition Classes
QueryPlan
lazy val sideEffectResult: Seq[InternalRow]

Inserts all the rows in the table into Hive.
Inserts all the rows in the table into Hive. Row objects are properly serialized with the org.apache.hadoop.hive.serde2.SerDe and the org.apache.hadoop.mapred.OutputFormat provided by the table definition.
Note: this is run once and then kept to avoid double insertions.

Attributes
protected[org.apache.spark.sql]
def simpleString: String

Definition Classes
QueryPlan → TreeNode
def sparkContext: SparkContext

Attributes
protected
Definition Classes
SparkPlan
final val sqlContext: SQLContext

Definition Classes
SparkPlan
val stagingDir: String
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
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val table: MetastoreRelation

the logical plan representing the table.
the logical plan representing the table. In the future this should be a org.apache.spark.sql.catalyst.catalog.CatalogTable once we converge Hive tables and data source tables.
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]): InsertIntoHiveTable.this.type

Definition Classes
QueryPlan
def transformChildren(rule: PartialFunction[SparkPlan, SparkPlan], nextOperation: (SparkPlan, PartialFunction[SparkPlan, SparkPlan]) ⇒ SparkPlan): SparkPlan

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

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

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

Definition Classes
QueryPlan
def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): InsertIntoHiveTable.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 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 execution

case class InsertIntoHiveTable(table: MetastoreRelation, partition: Map[String, Option[String]], child: SparkPlan, overwrite: Boolean, ifNotExists: Boolean) extends SparkPlan with UnaryExecNode with Product with Serializable

Instance Constructors

new InsertIntoHiveTable(table: MetastoreRelation, partition: Map[String, Option[String]], child: SparkPlan, overwrite: Boolean, ifNotExists: 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 canonicalized: SparkPlan

val child: 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]

lazy val constraints: ExpressionSet

lazy val containsChild: Set[TreeNode[_]]

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

final def getClass(): Class[_]

def getExtTmpPathRelTo(path: Path, hadoopConf: Configuration): Path

def getExternalTmpPath(path: Path, hadoopConf: Configuration): Path

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

val hadoopConf: Configuration

def hashCode(): Int

val ifNotExists: Boolean

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def innerChildren: Seq[QueryPlan[_]]

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

def jsonFields: List[JField]

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 mapProductIterator[B](f: (Any) ⇒ B)(implicit arg0: ClassTag[B]): Array[B]

def metadata: Map[String, String]

def metrics: Map[String, SQLMetric]

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

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

def newNaturalAscendingOrdering(dataTypes: Seq[DataType]): Ordering[InternalRow]