Class LogicalPlan

All Implemented Interfaces:
NamedWriteable, Writeable, Resolvable
Direct Known Subclasses:
BinaryPlan, Fork, LeafPlan, UnaryPlan

public abstract class LogicalPlan extends QueryPlan<LogicalPlan> implements Resolvable
A LogicalPlan is what (not the "how") a user told us they want to do. For example, a logical plan in English would be: "I want to get from DEN to SFO".
  • Constructor Details

  • Method Details

    • preAnalyzed

      public boolean preAnalyzed()
    • setPreAnalyzed

      public void setPreAnalyzed()
    • analyzed

      public boolean analyzed()
    • setAnalyzed

      public void setAnalyzed()
    • optimized

      public boolean optimized()
    • setOptimized

      public void setOptimized()
    • childrenResolved

      public final boolean childrenResolved()
    • resolved

      public boolean resolved()
      Specified by:
      resolved in interface Resolvable
    • expressionsResolved

      public abstract boolean expressionsResolved()
    • hashCode

      public abstract int hashCode()
      Overrides:
      hashCode in class Node<LogicalPlan>
    • equals

      public abstract boolean equals(Object obj)
      Overrides:
      equals in class Node<LogicalPlan>