Expand description
An explicit representation of a rendering plan for provided dataflows.
Modules§
- interpret
- Utilities and implementations for abstract interpretation of crate::plan::Plan structures.
- join
- Planning of
Plan::Join
operators, and supporting types. - lowering 🔒
- Lowering
DataflowDescription
s from MIR (MirRelationExpr
) to LIR (Plan
). - proto_
available_ collections - Nested message and enum types in
ProtoAvailableCollections
. - proto_
get_ plan - Nested message and enum types in
ProtoGetPlan
. - reduce
- Reduction execution planning and dataflow construction.
We build
ReducePlan
s to manage the complexity of planning the generated dataflow for a given reduce expression. The intent here is that each creating aReducePlan
should capture all of the decision making about what kind of dataflow do we need to render and what each operator needs to do, and then actually rendering the plan can be a relatively simple application of (as much as possible) straight line code. - render_
plan RenderPlan
, a representation of LIR plans used in the compute protocol and rendering, and support for convertingPlan
s into this representation.- threshold
- Threshold planning logic.
- top_k
- TopK planning logic.
- transform
- Utilities and implementations for transformation of crate::plan::Plan structures.
Structs§
- Available
Collections - The forms in which an operator’s output is available.
- LirId
- An identifier for an LIR node.
- LirId
Container - Derived columnar container for a struct.
- LirId
Reference - Derived columnar reference for a struct.
- Plan
- A rendering plan with as much conditional logic as possible removed.
- Proto
Available Collections - Proto
GetPlan - Proto
LetRec Limit
Enums§
Functions§
- any_
arranged_ 🔒thin - A strategy that produces arrangements that are thinner than the default. That is the number of direct children is limited to a maximum of 3.
- bucketing_
of_ 🔒expected_ group_ size - Returns bucket sizes, descending, suitable for hierarchical decomposition of an operator, based on the expected number of rows that will have the same group key.