Class

org.apache.spark.sql.catalyst.plans

QueryPlan

Related Doc: package plans

Permalink

abstract class QueryPlan[PlanType <: QueryPlan[PlanType]] extends TreeNode[PlanType]

Self Type
PlanType
Linear Supertypes
TreeNode[PlanType], Product, Equals, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. QueryPlan
  2. TreeNode
  3. Product
  4. Equals
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new QueryPlan()

    Permalink

Abstract Value Members

  1. abstract def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    Equals
  2. abstract def children: Seq[PlanType]

    Permalink

    Returns a Seq of the children of this node.

    Returns a Seq of the children of this node. Children should not change. Immutability required for containsChild optimization

    Definition Classes
    TreeNode
  3. abstract def output: Seq[Attribute]

    Permalink
  4. abstract def productArity: Int

    Permalink
    Definition Classes
    Product
  5. abstract def productElement(n: Int): Any

    Permalink
    Definition Classes
    Product

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. lazy val allAttributes: AttributeSeq

    Permalink

    All the attributes that are used for this plan.

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

    Permalink

    Returns the tree node at the specified number, used primarily for interactive debugging.

    Returns the tree node at the specified number, used primarily for interactive debugging. Numbers for each node can be found in the numberedTreeString.

    Note that this cannot return BaseType because logical plan's plan node might return physical plan for innerChildren, e.g. in-memory relation logical plan node has a reference to the physical plan node it is referencing.

    Definition Classes
    TreeNode
  6. def argString: String

    Permalink

    Returns a string representing the arguments to this node, minus any children

    Returns a string representing the arguments to this node, minus any children

    Definition Classes
    TreeNode
  7. def asCode: String

    Permalink

    Returns a 'scala code' representation of this TreeNode and its children.

    Returns a 'scala code' representation of this TreeNode and its children. Intended for use when debugging where the prettier toString function is obfuscating the actual structure. In the case of 'pure' TreeNodes that only contain primitives and other TreeNodes, the result can be pasted in the REPL to build an equivalent Tree.

    Definition Classes
    TreeNode
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. lazy val canonicalized: PlanType

    Permalink

    Canonicalized copy of this query plan.

    Canonicalized copy of this query plan.

    Attributes
    protected
  10. lazy val cleanArgs: Seq[Any]

    Permalink

    Args that have cleaned such that differences in expression id should not affect equality

    Args that have cleaned such that differences in expression id should not affect equality

    Attributes
    protected
  11. def cleanExpression(e: Expression): Expression

    Permalink
    Attributes
    protected
  12. def clone(): AnyRef

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

    Permalink

    Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.

    Returns a Seq containing the result of applying a partial function to all elements in this tree on which the function is defined.

    Definition Classes
    TreeNode
  14. def collectFirst[B](pf: PartialFunction[PlanType, B]): Option[B]

    Permalink

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

    Finds and returns the first TreeNode of the tree for which the given partial function is defined (pre-order), and applies the partial function to it.

    Definition Classes
    TreeNode
  15. def collectLeaves(): Seq[PlanType]

    Permalink

    Returns a Seq containing the leaves in this tree.

    Returns a Seq containing the leaves in this tree.

    Definition Classes
    TreeNode
  16. lazy val constraints: ExpressionSet

    Permalink

    An ExpressionSet that contains invariants about the rows output by this operator.

    An ExpressionSet that contains invariants about the rows output by this operator. For example, if this set contains the expression a = 2 then that expression is guaranteed to evaluate to true for all rows produced.

  17. lazy val containsChild: Set[TreeNode[_]]

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

    Permalink
    Definition Classes
    AnyRef
  19. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  20. final def expressions: Seq[Expression]

    Permalink

    Returns all of the expressions present in this query plan operator.

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

    Permalink

    Faster version of equality which short-circuits when two treeNodes are the same instance.

    Faster version of equality which short-circuits when two treeNodes are the same instance. We don't just override Object.equals, as doing so prevents the scala compiler from generating case class equals methods

    Definition Classes
    TreeNode
  22. def finalize(): Unit

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

    Permalink

    Find the first TreeNode that satisfies the condition specified by f.

    Find the first TreeNode that satisfies the condition specified by f. The condition is recursively applied to this node and all of its children (pre-order).

    Definition Classes
    TreeNode
  24. def flatMap[A](f: (PlanType) ⇒ TraversableOnce[A]): Seq[A]

    Permalink

    Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.

    Returns a Seq by applying a function to all nodes in this tree and using the elements of the resulting collections.

    Definition Classes
    TreeNode
  25. def foreach(f: (PlanType) ⇒ Unit): Unit

    Permalink

    Runs the given function on this node and then recursively on children.

    Runs the given function on this node and then recursively on children.

    f

    the function to be applied to each node in the tree.

    Definition Classes
    TreeNode
  26. def foreachUp(f: (PlanType) ⇒ Unit): Unit

    Permalink

    Runs the given function recursively on children then on this node.

    Runs the given function recursively on children then on this node.

    f

    the function to be applied to each node in the tree.

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

    Permalink

    Appends the string represent of this node and its children to the given StringBuilder.

    Appends the string represent of this node and its children to the given StringBuilder.

    The i-th element in lastChildren indicates whether the ancestor of the current node at depth i + 1 is the last child of its own parent node. The depth of the root node is 0, and lastChildren for the root node should be empty.

    Note that this traversal (numbering) order must be the same as getNodeNumbered.

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

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

    Permalink

    Extracts the relevant constraints from a given set of constraints based on the attributes that appear in the outputSet.

    Extracts the relevant constraints from a given set of constraints based on the attributes that appear in the outputSet.

    Attributes
    protected
  30. def hashCode(): Int

    Permalink
    Definition Classes
    TreeNode → AnyRef → Any
  31. def innerChildren: Seq[QueryPlan[_]]

    Permalink

    All the nodes that should be shown as a inner nested tree of this node.

    All the nodes that should be shown as a inner nested tree of this node. For example, this can be used to show sub-queries.

    Attributes
    protected
    Definition Classes
    QueryPlanTreeNode
  32. def inputSet: AttributeSet

    Permalink

    The set of all attributes that are input to this operator by its children.

  33. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  34. def jsonFields: List[JField]

    Permalink
    Attributes
    protected
    Definition Classes
    TreeNode
  35. def makeCopy(newArgs: Array[AnyRef]): PlanType

    Permalink

    Creates a copy of this type of tree node after a transformation.

    Creates a copy of this type of tree node after a transformation. Must be overridden by child classes that have constructor arguments that are not present in the productIterator.

    newArgs

    the new product arguments.

    Definition Classes
    TreeNode
  36. def map[A](f: (PlanType) ⇒ A): Seq[A]

    Permalink

    Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.

    Returns a Seq containing the result of applying the given function to each node in this tree in a preorder traversal.

    f

    the function to be applied.

    Definition Classes
    TreeNode
  37. def mapChildren(f: (PlanType) ⇒ PlanType): PlanType

    Permalink

    Returns a copy of this node where f has been applied to all the nodes children.

    Returns a copy of this node where f has been applied to all the nodes children.

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

    Permalink

    Apply a map function to each expression present in this query operator, and return a new query operator based on the mapped expressions.

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

    Permalink

    Efficient alternative to productIterator.map(f).toArray.

    Efficient alternative to productIterator.map(f).toArray.

    Attributes
    protected
    Definition Classes
    TreeNode
  40. def missingInput: AttributeSet

    Permalink

    Attributes that are referenced by expressions but not provided by this nodes children.

    Attributes that are referenced by expressions but not provided by this nodes children. Subclasses should override this method if they produce attributes internally as it is used by assertions designed to prevent the construction of invalid plans.

  41. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  42. def nodeName: String

    Permalink

    Returns the name of this type of TreeNode.

    Returns the name of this type of TreeNode. Defaults to the class name. Note that we remove the "Exec" suffix for physical operators here.

    Definition Classes
    TreeNode
  43. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  44. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  45. def numberedTreeString: String

    Permalink

    Returns a string representation of the nodes in this tree, where each operator is numbered.

    Returns a string representation of the nodes in this tree, where each operator is numbered. The numbers can be used with TreeNode.apply to easily access specific subtrees.

    The numbers are based on depth-first traversal of the tree (with innerChildren traversed first before children).

    Definition Classes
    TreeNode
  46. val origin: Origin

    Permalink
    Definition Classes
    TreeNode
  47. def otherCopyArgs: Seq[AnyRef]

    Permalink

    Args to the constructor that should be copied, but not transformed.

    Args to the constructor that should be copied, but not transformed. These are appended to the transformed args automatically by makeCopy

    Attributes
    protected
    Definition Classes
    TreeNode
  48. def outputSet: AttributeSet

    Permalink

    Returns the set of attributes that are output by this node.

  49. def p(number: Int): PlanType

    Permalink

    Returns the tree node at the specified number, used primarily for interactive debugging.

    Returns the tree node at the specified number, used primarily for interactive debugging. Numbers for each node can be found in the numberedTreeString.

    This is a variant of apply that returns the node as BaseType (if the type matches).

    Definition Classes
    TreeNode
  50. def prettyJson: String

    Permalink
    Definition Classes
    TreeNode
  51. def printSchema(): Unit

    Permalink

    Prints out the schema in the tree format

  52. def producedAttributes: AttributeSet

    Permalink

    The set of all attributes that are produced by this node.

  53. def productIterator: Iterator[Any]

    Permalink
    Definition Classes
    Product
  54. def productPrefix: String

    Permalink
    Definition Classes
    Product
  55. def references: AttributeSet

    Permalink

    All Attributes that appear in expressions from this operator.

    All Attributes that appear in expressions from this operator. Note that this set does not include attributes that are implicitly referenced by being passed through to the output tuple.

  56. def sameResult(plan: PlanType): Boolean

    Permalink

    Returns true when the given query plan will return the same results as this query plan.

    Returns true when the given query plan will return the same results as this query plan.

    Since its likely undecidable to generally determine if two given plans will produce the same results, it is okay for this function to return false, even if the results are actually the same. Such behavior will not affect correctness, only the application of performance enhancements like caching. However, it is not acceptable to return true if the results could possibly be different.

    By default this function performs a modified version of equality that is tolerant of cosmetic differences like attribute naming and or expression id differences. Operators that can do better should override this function.

  57. lazy val schema: StructType

    Permalink
  58. def schemaString: String

    Permalink

    Returns the output schema in the tree format.

  59. def simpleString: String

    Permalink

    ONE line description of this node.

    ONE line description of this node.

    Definition Classes
    QueryPlanTreeNode
  60. def statePrefix: String

    Permalink

    A prefix string used when printing the plan.

    A prefix string used when printing the plan.

    We use "!" to indicate an invalid plan, and "'" to indicate an unresolved plan.

    Attributes
    protected
  61. def stringArgs: Iterator[Any]

    Permalink

    The arguments that should be included in the arg string.

    The arguments that should be included in the arg string. Defaults to the productIterator.

    Attributes
    protected
    Definition Classes
    TreeNode
  62. def subqueries: Seq[PlanType]

    Permalink

    All the subqueries of current plan.

  63. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  64. def toJSON: String

    Permalink
    Definition Classes
    TreeNode
  65. def toString(): String

    Permalink
    Definition Classes
    TreeNode → AnyRef → Any
  66. def transform(rule: PartialFunction[PlanType, PlanType]): PlanType

    Permalink

    Returns a copy of this node where rule has been recursively applied to the tree.

    Returns a copy of this node where rule has been recursively applied to the tree. When rule does not apply to a given node it is left unchanged. Users should not expect a specific directionality. If a specific directionality is needed, transformDown or transformUp should be used.

    rule

    the function use to transform this nodes children

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

    Permalink

    Returns the result of running transformExpressions on this node and all its children.

  68. def transformDown(rule: PartialFunction[PlanType, PlanType]): PlanType

    Permalink

    Returns a copy of this node where rule has been recursively applied to it and all of its children (pre-order).

    Returns a copy of this node where rule has been recursively applied to it and all of its children (pre-order). When rule does not apply to a given node it is left unchanged.

    rule

    the function used to transform this nodes children

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

    Permalink

    Runs transform with rule on all expressions present in this query operator.

    Runs transform with rule on all expressions present in this query operator. Users should not expect a specific directionality. If a specific directionality is needed, transformExpressionsDown or transformExpressionsUp should be used.

    rule

    the rule to be applied to every expression in this operator.

  70. def transformExpressionsDown(rule: PartialFunction[Expression, Expression]): QueryPlan.this.type

    Permalink

    Runs transformDown with rule on all expressions present in this query operator.

    Runs transformDown with rule on all expressions present in this query operator.

    rule

    the rule to be applied to every expression in this operator.

  71. def transformExpressionsUp(rule: PartialFunction[Expression, Expression]): QueryPlan.this.type

    Permalink

    Runs transformUp with rule on all expressions present in this query operator.

    Runs transformUp with rule on all expressions present in this query operator.

    rule

    the rule to be applied to every expression in this operator.

  72. def transformUp(rule: PartialFunction[PlanType, PlanType]): PlanType

    Permalink

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order).

    Returns a copy of this node where rule has been recursively applied first to all of its children and then itself (post-order). When rule does not apply to a given node, it is left unchanged.

    rule

    the function use to transform this nodes children

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

    Permalink
    Definition Classes
    TreeNode
  74. def treeString: String

    Permalink

    Returns a string representation of the nodes in this tree

    Returns a string representation of the nodes in this tree

    Definition Classes
    TreeNode
  75. def validConstraints: Set[Expression]

    Permalink

    This method can be overridden by any child class of QueryPlan to specify a set of constraints based on the given operator's constraint propagation logic.

    This method can be overridden by any child class of QueryPlan to specify a set of constraints based on the given operator's constraint propagation logic. These constraints are then canonicalized and filtered automatically to contain only those attributes that appear in the outputSet.

    See Canonicalize for more details.

    Attributes
    protected
  76. def verboseString: String

    Permalink

    ONE line description of this node with more information

    ONE line description of this node with more information

    Definition Classes
    QueryPlanTreeNode
  77. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  78. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  79. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  80. def withNewChildren(newChildren: Seq[PlanType]): PlanType

    Permalink

    Returns a copy of this node with the children replaced.

    Returns a copy of this node with the children replaced. TODO: Validate somewhere (in debug mode?) that children are ordered correctly.

    Definition Classes
    TreeNode

Inherited from TreeNode[PlanType]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped