Record Class PhysicalNode.Spool
- Record Components:
schema- the output schema; always the input's schemaid- the identifier the executor buffers this sub-plan under; unique within one planned queryinput- the sub-plan whose rows are shared
- All Implemented Interfaces:
PhysicalNode
- Enclosing interface:
PhysicalNode
Spool appears at every site that reads it,
so the plan is a directed acyclic graph at this node rather than a tree.
Without it, a plan is a tree and every occurrence of a sub-expression is
executed independently — which is why the symmetric difference
A ∆ B, whose two branches (A − B) and (B − A) each
read both inputs, would otherwise evaluate A and B twice
apiece.
The executor keys its buffer on id, not on object identity, so a
plan that is copied or rebuilt keeps sharing what it shared before. Ids are
unique within one planned query and carry no meaning across queries.
Sharing is not free and not always allowed. Replaying rows means holding them, so the executor buffers under a row budget and falls back to re-executing the sub-plan when the budget is exceeded — never a wrong answer, only the cost that was being avoided. The planner also declines to spool a sub-expression whose two evaluations are entitled to differ: one that reads system state (a random draw, an unseeded sample), or one that names a recursive relation whose value changes with every iteration.
A spool is transparent to everything above it: it emits exactly its input's rows, in its input's order, under its input's schema, so no consumer — including a positional one — can tell a spooled sub-plan from an unspooled one.
-
Nested Class Summary
Nested classes/interfaces inherited from interface com.darkcollective.relix.plan.PhysicalNode
PhysicalNode.Aggregate, PhysicalNode.AsOfJoin, PhysicalNode.BernoulliSample, PhysicalNode.BuildSide, PhysicalNode.Closure, PhysicalNode.Cluster, PhysicalNode.ConstructiveCover, PhysicalNode.Cover, PhysicalNode.Distinct, PhysicalNode.Division, PhysicalNode.Downsample, PhysicalNode.Empty, PhysicalNode.Fixpoint, PhysicalNode.IntervalJoin, PhysicalNode.Iterate, PhysicalNode.Join, PhysicalNode.JoinAlgorithm, PhysicalNode.JoinKeys, PhysicalNode.JoinKind, PhysicalNode.LateralJoin, PhysicalNode.Limit, PhysicalNode.Optimize, PhysicalNode.Path, PhysicalNode.Pivot, PhysicalNode.Project, PhysicalNode.PushedScan, PhysicalNode.RecursiveRef, PhysicalNode.Rename, PhysicalNode.ReservoirSample, PhysicalNode.Scan, PhysicalNode.Select, PhysicalNode.Sessionize, PhysicalNode.SetKind, PhysicalNode.SetOp, PhysicalNode.Solve, PhysicalNode.Sort, PhysicalNode.Spool, PhysicalNode.TopK, PhysicalNode.Trace, PhysicalNode.Tree, PhysicalNode.Universal, PhysicalNode.Unnest, PhysicalNode.Unpivot, PhysicalNode.Why, PhysicalNode.Window -
Constructor Summary
ConstructorsConstructorDescriptionSpool(Schema schema, int id, PhysicalNode input) Creates an instance of aSpoolrecord class. -
Method Summary
Modifier and TypeMethodDescriptionchildren()Direct child plans, left-to-right; empty for aPhysicalNode.Scan.TheOrderingthat this node delivers on its output stream.final booleanIndicates whether some other object is "equal to" this one.final inthashCode()Returns a hash code value for this object.intid()Returns the value of theidrecord component.input()Returns the value of theinputrecord component.schema()Returns the value of theschemarecord component.final StringtoString()Returns a string representation of this record class.Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface com.darkcollective.relix.plan.PhysicalNode
mapChildren
-
Constructor Details
-
Method Details
-
children
Description copied from interface:PhysicalNodeDirect child plans, left-to-right; empty for aPhysicalNode.Scan.- Specified by:
childrenin interfacePhysicalNode
-
deliveredOrdering
Description copied from interface:PhysicalNodeTheOrderingthat this node delivers on its output stream. The default implementation returnsOrdering.none()— meaning no guaranteed row order — which is the conservative safe answer for any operator that does not propagate or establish an ordering. Individual nodes that do preserve order (PhysicalNode.Select,PhysicalNode.Limit) or establish it (PhysicalNode.Sort) override this method.- Specified by:
deliveredOrderingin interfacePhysicalNode- Returns:
- the delivered ordering; never null
-
toString
Returns a string representation of this record class. The representation contains the name of the class, followed by the name and value of each of the record components. -
hashCode
public final int hashCode()Returns a hash code value for this object. The value is derived from the hash code of each of the record components. -
equals
Indicates whether some other object is "equal to" this one. The objects are equal if the other object is of the same class and if all the record components are equal. Reference components are compared withObjects::equals(Object,Object); primitive components are compared with '=='. -
schema
Returns the value of theschemarecord component.- Specified by:
schemain interfacePhysicalNode- Returns:
- the value of the
schemarecord component
-
id
public int id()Returns the value of theidrecord component.- Returns:
- the value of the
idrecord component
-
input
Returns the value of theinputrecord component.- Returns:
- the value of the
inputrecord component
-