Enum mz_compute_types::plan::flat_plan::FlatPlanNode
source · pub enum FlatPlanNode<T = Timestamp> {
Constant {
rows: Result<Vec<(Row, T, Diff)>, EvalError>,
},
Get {
id: Id,
keys: AvailableCollections,
plan: GetPlan,
},
LetRec {
ids: Vec<LocalId>,
values: Vec<LirId>,
limits: Vec<Option<LetRecLimit>>,
body: LirId,
},
Mfp {
input: LirId,
mfp: MapFilterProject,
input_key_val: Option<(Vec<MirScalarExpr>, Option<Row>)>,
},
FlatMap {
input: LirId,
func: TableFunc,
exprs: Vec<MirScalarExpr>,
mfp_after: MapFilterProject,
input_key: Option<Vec<MirScalarExpr>>,
},
Join {
inputs: Vec<LirId>,
plan: JoinPlan,
},
Reduce {
input: LirId,
key_val_plan: KeyValPlan,
plan: ReducePlan,
input_key: Option<Vec<MirScalarExpr>>,
mfp_after: MapFilterProject,
},
TopK {
input: LirId,
top_k_plan: TopKPlan,
},
Negate {
input: LirId,
},
Threshold {
input: LirId,
threshold_plan: ThresholdPlan,
},
Union {
inputs: Vec<LirId>,
consolidate_output: bool,
},
ArrangeBy {
input: LirId,
forms: AvailableCollections,
input_key: Option<Vec<MirScalarExpr>>,
input_mfp: MapFilterProject,
},
}
Expand description
Variants§
Constant
A collection containing a pre-determined collection.
Get
A reference to a bound collection.
This is commonly either an external reference to an existing source or maintained
arrangement, or an internal reference to a LetRec
identifier.
Fields
keys: AvailableCollections
Arrangements that will be available.
The collection will also be loaded if available, which it will not be for imported data, but which it may be for locally defined data.
LetRec
Binds values
to ids
, evaluates them potentially recursively, and returns body
.
All bindings are available to all bindings, and to body
. The contents of each binding are
initially empty, and then updated through a sequence of iterations in which each binding is
updated in sequence, from the most recent values of all bindings.
Fields
limits: Vec<Option<LetRecLimit>>
Maximum number of iterations. See further info on the MIR LetRec
.
Mfp
Map, Filter, and Project operators.
This stage contains work that we would ideally like to fuse to other plan stages, but for practical reasons cannot. For example: threshold, topk, and sometimes reduce stages are not able to absorb this operator.
Fields
mfp: MapFilterProject
Linear operator to apply to each record.
FlatMap
A variable number of output records for each input record.
This stage is a bit of a catch-all for logic that does not easily fit in map stages. This includes table valued functions, but also functions of multiple arguments, and functions that modify the sign of updates.
This stage allows a MapFilterProject
operator to be fused to its output, and this can be
very important as otherwise the output of func
is just appended to the input record, for
as many outputs as it has. This has the unpleasant default behavior of repeating
potentially large records that are being unpacked, producing quadratic output in those
cases. Instead, in these cases use a mfp
member that projects away these large fields.
Fields
exprs: Vec<MirScalarExpr>
Expressions that for each row prepare the arguments to func
.
mfp_after: MapFilterProject
Linear operator to apply to each record produced by func
.
input_key: Option<Vec<MirScalarExpr>>
The particular arrangement of the input we expect to use, if any.
Join
A multiway relational equijoin, with fused map, filter, and projection.
This stage performs a multiway join among inputs
, using the equality constraints
expressed in plan
. The plan also describes the implementation strategy we will use, and
any pushed down per-record work.
Fields
Reduce
Aggregation by key.
Fields
key_val_plan: KeyValPlan
A plan for changing input records into key, value pairs.
plan: ReducePlan
A plan for performing the reduce.
The implementation of reduction has several different strategies based on the properties of the reduction, and the input itself. Please check out the documentation for this type for more detail.
input_key: Option<Vec<MirScalarExpr>>
The particular arrangement of the input we expect to use, if any.
mfp_after: MapFilterProject
An MFP that must be applied to results. The projection part of this MFP must preserve the key for the reduction; otherwise, the results become undefined. Additionally, the MFP must be free from temporal predicates so that it can be readily evaluated.
TopK
Key-based “Top K” operator, retaining the first K records in each group.
Fields
Negate
Inverts the sign of each update.
Threshold
Filters records that accumulate negatively.
Although the operator suppresses updates, it is a stateful operator taking resources proportional to the number of records with non-zero accumulation.
Fields
threshold_plan: ThresholdPlan
A plan for performing the threshold.
The implementation of threshold has several different strategies based on the properties of the threshold, and the input itself. Please check out the documentation for this type for more detail.
Union
Adds the contents of the input collections.
Importantly, this is multiset union, so the multiplicities of records will add. This is
in contrast to set union, where the multiplicities would be capped at one. A set union
can be formed with Union
followed by Reduce
implementing the “distinct” operator.
Fields
ArrangeBy
The input
plan, but with additional arrangements.
This operator does not change the logical contents of input
, but ensures that certain
arrangements are available in the results. This operator can be important for e.g. the
Join
stage which benefits from multiple arrangements or to cap a Plan
so that indexes
can be exported.
Fields
forms: AvailableCollections
A list of arrangement keys, and possibly a raw collection, that will be added to those of the input.
If any of these collection forms are already present in the input, they have no effect.
input_key: Option<Vec<MirScalarExpr>>
The key that must be used to access the input.
input_mfp: MapFilterProject
The MFP that must be applied to the input.
Trait Implementations§
source§impl<T: Clone> Clone for FlatPlanNode<T>
impl<T: Clone> Clone for FlatPlanNode<T>
source§fn clone(&self) -> FlatPlanNode<T>
fn clone(&self) -> FlatPlanNode<T>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<T: Debug> Debug for FlatPlanNode<T>
impl<T: Debug> Debug for FlatPlanNode<T>
source§impl<'de, T> Deserialize<'de> for FlatPlanNode<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for FlatPlanNode<T>where
T: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
source§impl<T: PartialEq> PartialEq for FlatPlanNode<T>
impl<T: PartialEq> PartialEq for FlatPlanNode<T>
source§fn eq(&self, other: &FlatPlanNode<T>) -> bool
fn eq(&self, other: &FlatPlanNode<T>) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl ProtoMapEntry<u64, FlatPlanNode> for ProtoNode
impl ProtoMapEntry<u64, FlatPlanNode> for ProtoNode
fn from_rust(entry: (&LirId, &FlatPlanNode)) -> Self
fn into_rust(self) -> Result<(LirId, FlatPlanNode), TryFromProtoError>
source§impl RustType<ProtoFlatPlanNode> for FlatPlanNode
impl RustType<ProtoFlatPlanNode> for FlatPlanNode
source§fn into_proto(&self) -> ProtoFlatPlanNode
fn into_proto(&self) -> ProtoFlatPlanNode
Self
into a Proto
value.source§fn from_proto(proto: ProtoFlatPlanNode) -> Result<Self, TryFromProtoError>
fn from_proto(proto: ProtoFlatPlanNode) -> Result<Self, TryFromProtoError>
source§impl<T> Serialize for FlatPlanNode<T>where
T: Serialize,
impl<T> Serialize for FlatPlanNode<T>where
T: Serialize,
impl<T> StructuralPartialEq for FlatPlanNode<T>
Auto Trait Implementations§
impl<T> Freeze for FlatPlanNode<T>
impl<T> RefUnwindSafe for FlatPlanNode<T>where
T: RefUnwindSafe,
impl<T> Send for FlatPlanNode<T>where
T: Send,
impl<T> Sync for FlatPlanNode<T>where
T: Sync,
impl<T> Unpin for FlatPlanNode<T>where
T: Unpin,
impl<T> UnwindSafe for FlatPlanNode<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<R, O, T> CopyOnto<ConsecutiveOffsetPairs<R, O>> for T
impl<R, O, T> CopyOnto<ConsecutiveOffsetPairs<R, O>> for T
source§fn copy_onto(
self,
target: &mut ConsecutiveOffsetPairs<R, O>
) -> <ConsecutiveOffsetPairs<R, O> as Region>::Index
fn copy_onto( self, target: &mut ConsecutiveOffsetPairs<R, O> ) -> <ConsecutiveOffsetPairs<R, O> as Region>::Index
source§impl<T> FmtForward for T
impl<T> FmtForward for T
source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self
to use its Binary
implementation when Debug
-formatted.source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self
to use its Display
implementation when
Debug
-formatted.source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self
to use its LowerExp
implementation when
Debug
-formatted.source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self
to use its LowerHex
implementation when
Debug
-formatted.source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self
to use its Octal
implementation when Debug
-formatted.source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self
to use its Pointer
implementation when
Debug
-formatted.source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self
to use its UpperExp
implementation when
Debug
-formatted.source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self
to use its UpperHex
implementation when
Debug
-formatted.source§impl<T> FutureExt for T
impl<T> FutureExt for T
source§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
source§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request
source§impl<T, U> OverrideFrom<Option<&T>> for Uwhere
U: OverrideFrom<T>,
impl<T, U> OverrideFrom<Option<&T>> for Uwhere
U: OverrideFrom<T>,
source§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read moresource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read moresource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> R
source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self
, then passes self.as_ref()
into the pipe function.source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self
, then passes self.as_mut()
into the pipe
function.source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self
, then passes self.deref()
into the pipe function.source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> ProgressEventTimestamp for T
impl<T> ProgressEventTimestamp for T
source§impl<P, R> ProtoType<R> for Pwhere
R: RustType<P>,
impl<P, R> ProtoType<R> for Pwhere
R: RustType<P>,
source§fn into_rust(self) -> Result<R, TryFromProtoError>
fn into_rust(self) -> Result<R, TryFromProtoError>
RustType::from_proto
.source§fn from_rust(rust: &R) -> P
fn from_rust(rust: &R) -> P
RustType::into_proto
.source§impl<T> Tap for T
impl<T> Tap for T
source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B>
of a value. Read moresource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B>
of a value. Read moresource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R>
view of a value. Read moresource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R>
view of a value. Read moresource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target
of a value. Read moresource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target
of a value. Read moresource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap()
only in debug builds, and is erased in release builds.source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut()
only in debug builds, and is erased in release
builds.source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow()
only in debug builds, and is erased in release
builds.source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref()
only in debug builds, and is erased in release
builds.source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut()
only in debug builds, and is erased in release
builds.source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref()
only in debug builds, and is erased in release
builds.