CreateViewCommand

Instance Constructors

new CreateViewCommand(tableDesc: CatalogTable, child: LogicalPlan, allowExisting: Boolean, replace: Boolean, isTemporary: Boolean)

tableDesc
the catalog table
child
the logical plan that represents the view; this is used to generate a canonicalized version of the SQL that can be saved in the catalog.
allowExisting
if true, and if the view already exists, noop; if false, and if the view already exists, throws analysis exception.
replace
if true, and if the view already exists, updates it; if false, and if the view already exists, throws analysis exception.
isTemporary
if true, the view is created as a temporary view. Temporary views are dropped at the end of current Spark session. Existing permanent relations with the same name are not visible to the current session while the temporary view exists, unless they are specified with full qualified table name with database prefix.

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

Definition Classes
QueryPlan
val allowExisting: Boolean

if true, and if the view already exists, noop; if false, and if the view already exists, throws analysis exception.
def analyzed: Boolean

Definition Classes
LogicalPlan
def apply(number: Int): LogicalPlan

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: LogicalPlan

Definition Classes
LogicalPlan → QueryPlan
val child: LogicalPlan

the logical plan that represents the view; this is used to generate a canonicalized version of the SQL that can be saved in the catalog.
final def children: Seq[LogicalPlan]

Definition Classes
Command → LeafNode → TreeNode
def childrenResolved: Boolean

Definition Classes
LogicalPlan
lazy val cleanArgs: Seq[Any]

Attributes
protected
Definition Classes
QueryPlan
def clone(): AnyRef

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

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

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

Definition Classes
TreeNode
lazy val constraints: ExpressionSet

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

Definition Classes
TreeNode
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
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: (LogicalPlan) ⇒ Boolean): Option[LogicalPlan]

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

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

Definition Classes
TreeNode
def foreachUp(f: (LogicalPlan) ⇒ 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 getNodeNumbered(number: MutableInt): LogicalPlan

Attributes
protected
Definition Classes
TreeNode
def getRelevantConstraints(constraints: Set[Expression]): Set[Expression]

Attributes
protected
Definition Classes
QueryPlan
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
CreateViewCommand → QueryPlan → TreeNode
def inputSet: AttributeSet

Definition Classes
QueryPlan
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isStreaming: Boolean

Definition Classes
LogicalPlan
val isTemporary: Boolean

if true, the view is created as a temporary view.
if true, the view is created as a temporary view. Temporary views are dropped at the end of current Spark session. Existing permanent relations with the same name are not visible to the current session while the temporary view exists, unless they are specified with full qualified table name with database prefix.
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
def jsonFields: List[(String, JValue)]

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 makeCopy(newArgs: Array[AnyRef]): LogicalPlan

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

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

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

Attributes
protected
Definition Classes
TreeNode
def maxRows: Option[Long]

Definition Classes
LogicalPlan
def missingInput: AttributeSet

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

Definition Classes
AnyRef
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
Command → QueryPlan
def outputSet: AttributeSet

Definition Classes
QueryPlan
def prettyJson: String

Definition Classes
TreeNode
def printSchema(): Unit

Definition Classes
QueryPlan
def producedAttributes: AttributeSet

Definition Classes
LeafNode → QueryPlan
def references: AttributeSet

Definition Classes
QueryPlan
def refresh(): Unit

Definition Classes
LogicalPlan
val replace: Boolean

if true, and if the view already exists, updates it; if false, and if the view already exists, throws analysis exception.
def resolve(nameParts: Seq[String], input: Seq[Attribute], resolver: (String, String) ⇒ Boolean): Option[NamedExpression]

Attributes
protected
Definition Classes
LogicalPlan
def resolve(nameParts: Seq[String], resolver: (String, String) ⇒ Boolean): Option[NamedExpression]

Definition Classes
LogicalPlan
def resolve(schema: StructType, resolver: (String, String) ⇒ Boolean): Seq[Attribute]

Definition Classes
LogicalPlan
def resolveChildren(nameParts: Seq[String], resolver: (String, String) ⇒ Boolean): Option[NamedExpression]

Definition Classes
LogicalPlan
def resolveExpressions(r: PartialFunction[Expression, Expression]): LogicalPlan

Definition Classes
LogicalPlan
def resolveOperators(rule: PartialFunction[LogicalPlan, LogicalPlan]): LogicalPlan

Definition Classes
LogicalPlan
def resolveQuoted(name: String, resolver: (String, String) ⇒ Boolean): Option[NamedExpression]

Definition Classes
LogicalPlan
lazy val resolved: Boolean

Definition Classes
LogicalPlan
def run(sparkSession: SparkSession): Seq[Row]

Definition Classes
CreateViewCommand → RunnableCommand
def sameResult(plan: LogicalPlan): 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 statePrefix: String

Attributes
protected
Definition Classes
LogicalPlan → QueryPlan
def statistics: Statistics

Definition Classes
LogicalPlan
def stringArgs: Iterator[Any]

Attributes
protected
Definition Classes
TreeNode
def subqueries: Seq[LogicalPlan]

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

Definition Classes
AnyRef
val tableDesc: CatalogTable

the catalog table
def toJSON: String

Definition Classes
TreeNode
def toString(): String

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

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

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

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

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

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

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

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

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 withNewChildren(newChildren: Seq[LogicalPlan]): LogicalPlan

Definition Classes
TreeNode

case class CreateViewCommand(tableDesc: CatalogTable, child: LogicalPlan, allowExisting: Boolean, replace: Boolean, isTemporary: Boolean) extends LeafNode with RunnableCommand with Product with Serializable

Instance Constructors

new CreateViewCommand(tableDesc: CatalogTable, child: LogicalPlan, allowExisting: Boolean, replace: Boolean, isTemporary: Boolean)

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

lazy val allAttributes: AttributeSeq

val allowExisting: Boolean

def analyzed: Boolean

def apply(number: Int): LogicalPlan

def argString: String

def asCode: String

final def asInstanceOf[T0]: T0

lazy val canonicalized: LogicalPlan

val child: LogicalPlan

final def children: Seq[LogicalPlan]

def childrenResolved: Boolean

lazy val cleanArgs: Seq[Any]

def clone(): AnyRef

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

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

def collectLeaves(): Seq[LogicalPlan]

lazy val constraints: ExpressionSet

lazy val containsChild: Set[TreeNode[_]]

final def eq(arg0: AnyRef): Boolean

final def expressions: Seq[Expression]

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

def finalize(): Unit

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

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

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

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

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

final def getClass(): Class[_]

def getNodeNumbered(number: MutableInt): LogicalPlan

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

def hashCode(): Int

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

def innerChildren: Seq[QueryPlan[_]]

def inputSet: AttributeSet

final def isInstanceOf[T0]: Boolean

def isStreaming: Boolean

val isTemporary: Boolean

def isTraceEnabled(): Boolean

def jsonFields: List[(String, JValue)]

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]): LogicalPlan

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

def mapChildren(f: (LogicalPlan) ⇒ LogicalPlan): LogicalPlan

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

def maxRows: Option[Long]

def missingInput: AttributeSet

final def ne(arg0: AnyRef): Boolean

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 outputSet: AttributeSet

def prettyJson: String

def printSchema(): Unit

def producedAttributes: AttributeSet

def references: AttributeSet