→Constant (2 rows) |
| **Stream, Arranged, Index Lookup, Read** | Produces rows from either an existing relation (source/view/materialized view/table) or from a previous CTE in the same plan. A Fused with Child Map/Filter/Project line above this operator means that Map/Filter/Project runs inside it.
There are four types of Get.
Stream indicates that the results are not arranged in memory and will be streamed directly.
Arranged indicates that the results are arranged in memory.
Index Lookup indicates the results will be looked up in an existing arrangement.
Read indicates that the results are unarranged, and will be processed as they arrive.
Arranged materialize.public.t |
| **Map/Filter/Project** | Computes new columns (maps), filters columns, and projects away columns. Works row-by-row. Maps and filters will be printed, but projects will not.
A Map/Filter/Project fused into a neighboring operator is printed as Fused with Child Map/Filter/Project above that operator, or as Fused with Parent Map/Filter/Project below an Arrange, and runs inside that operator rather than on its own.
A temporal filter, one whose predicate uses mz_now(), also schedules a retraction of each row for the moment it stops satisfying the predicate. Until then, the operator downstream holds that pending retraction in memory, one per live row.
Map. Each row may also have less data, from the Project. There may be fewer rows, from the Filter. **Uses memory:** No | →Map/Filter/Project Filter: (#0{a} < 7) Map: (#0{a} + #1{b}) Appends the result of some (one-to-many) table function to each row in the input.
A Fused with Child Table Function unnest_list line above a Non-incremental GroupAggregate means the unnest_list call runs inside that aggregation, which is part of how window functions are compiled to dataflows.
A Fused with Child Map/Filter/Project line above this operator means that Map/Filter/Project runs inside it.
→Table Function generate_series(#0{a}, #1{b}, 1) Input key: (#0{a}) Both join operators indicate the join ordering selected.
Returns combinations of rows from each input whenever some equality predicates are true.
Joins will indicate the join order of their children, starting from 0. For example, Differential Join %1 » %0 will join its second child into its first.
The two joins differ in performance characteristics.
Differential Cross Join and Delta Cross Join mark a join with a stage that has no equality keys. One-Shot Delta Join marks the single-path plan of a one-shot SELECT; an index or materialized view over the same query uses the multi-path Delta Join.
→Differential Join %1 » %0 Join stage %0: Lookup key #0{a} in %0 Groups the input rows by some scalar expressions, reduces each group using some aggregate functions, and produces rows containing the group key and aggregate outputs.
There are four types of GroupAggregate, ordered by increasing complexity:
Distinct GroupAggregate corresponds to the SQL DISTINCT operator.
Accumulable GroupAggregate (e.g., SUM, COUNT) corresponds to several easy to implement aggregations that can be executed efficiently.
Hierarchical aggregations (e.g., MIN, MAX) require a tower of arrangements. They are printed as Bucketed Hierarchical GroupAggregate, or as the more efficient Monotonic GroupAggregate when the input never retracts data. Bucketed ones may benefit from a hint; see mz_introspection.mz_expected_group_size_advice. A Consolidating prefix means the operator consolidates its input first, which uses memory while the input is being consolidated, largely at hydration time.
Non-incremental GroupAggregate (e.g., window functions, list_agg) corresponds to a single non-incremental aggregation. These are the most computationally intensive reductions.
A query that mixes aggregations of different types is planned as one GroupAggregate per type, joined together on the group key.
A Temporally-Bucketed prefix means the input carries future-dated updates from a temporal filter.
A Fused with Child Map/Filter/Project line above this operator means that Map/Filter/Project runs inside it.
Distinct and Accumulable aggregates use a moderate amount of memory (proportional to twice the output size). MIN and MAX aggregates can use significantly more memory. This can be improved by including group size hints in the query, see mz_introspection.mz_expected_group_size_advice. A hint shrinks the tower of intermediate arrangements (the buckets list of a Bucketed Hierarchical GroupAggregate); the input rows stay arranged either way, so a hint cannot bring a MIN or MAX below the size of its input. Non-incremental aggregates use memory proportional to the input + output size. A mix of aggregation types uses the memory of each GroupAggregate plus the arrangements of the join that combines them. | →Accumulable GroupAggregate Simple aggregates: count(*) Post-process Map/Filter/Project Filter: (#0 > 1) Groups the input rows, sorts them according to some ordering, and returns at most K rows at some offset from the top of the list, where K is some (possibly computed) limit.
There are three types of TopK. Two are special cased for monotonic inputs (i.e., inputs which never retract data).
Monotonic Top1.Monotonic TopK, which may give an expression indicating the limit.Non-monotonic TopK, a generic TopK plan.Each version of the TopK operator may include grouping, ordering, and limit directives. A Consolidating prefix means the operator consolidates its input first, and a Temporally-Bucketed prefix means the input carries future-dated updates from a temporal filter.
Monotonic Top1 and Monotonic TopK use a moderate amount of memory. Non-monotonic TopK uses significantly more memory as the operator can significantly overestimate the group sizes. Consult mz_introspection.mz_expected_group_size_advice. A LIMIT INPUT GROUP SIZE hint is not displayed in this plan; the optimized plan shows it as exp_group_size. | →Consolidating Monotonic TopK Order By #1 asc nulls_last, #0 desc nulls_first Limit 5 →Negate Diffs |
| **Threshold Diffs** | Removes any rows with negative counts. **Can increase data size:** No **Uses memory:** ✅ Arranges both its input and its output by the whole row, so it uses memory proportional to the input size plus the output size. | →Threshold Diffs |
| **Union** | Combines its inputs into a unified output, emitting one row for each row on any input. (Corresponds to UNION ALL rather than UNION/UNION DISTINCT.) **Can increase data size:** No **Uses memory:** ✅ A Consolidating Union will make moderate use of memory, particularly at hydration time. A Union that is not Consolidating will not consume memory. | →Consolidating Union |
| **Arrange** | Indicates a point that will become an arrangement in the dataflow engine, i.e., it will consume memory to cache results. **Can increase data size:** No **Uses memory:** ✅ Uses memory proportional to the input size. Note that in the LIR / physical plan, Arrange/ArrangeBy almost always means that an arrangement will actually be created. (This is in contrast to the “optimized” plan, where an ArrangeBy being present in the plan often does not mean that an arrangement will actually be created.) | →Arrange Keys: 1 arrangement available, plus raw stream Arrangement 0: #0 →Unarranged Raw Stream |
| **With ... Return ...** | Introduces CTEs, i.e., makes it possible for sub-plans to be consumed multiple times by downstream operators. **Can increase data size:** No **Uses memory:** No | See Reading plans |
**Notes:**
- **Can increase data size:** Specifies whether the operator can increase the data size (can be the number of rows or the number of columns).
- **Uses memory:** Specifies whether the operator use memory to maintain state for its inputs.
**In decorrelated and optimized plans:**
The following table lists the operators that are available in the optimized plan.
- For those operators that require memory to maintain intermediate state, **Uses memory** is marked with **Yes**.
- For those operators that expand the data size (either rows or columns), **Can increase data size** is marked with **Yes**.| Operator | Description | Example |
| --- | --- | --- |
| **Constant** | Always produces the same collection of rows. **Can increase data size:** No **Uses memory:** No | Constant - ((1, 2) x 2) - (3, 4) Get materialize.public.ordered |
| **Project** | Produces a subset of the columns in the input rows. See also column numbering. **Can increase data size:** No **Uses memory:** No | Project (#2, #3) |
| **Map** | Appends the results of some scalar expressions to each row in the input. **Can increase data size:** Each row has more data (i.e., longer rows but same number of rows). **Uses memory:** No | Map (((#1 * 10000000dec) / #2) * 1000dec) |
| **FlatMap** | Appends the result of some (one-to-many) table function to each row in the input. **Can increase data size:** Depends on the table function used. **Uses memory:** No | FlatMap jsonb_foreach(#3) |
| **Filter** | Removes rows of the input for which some scalar predicates return false.
A temporal filter, one whose predicate uses mz_now(), also schedules a retraction of each row for the moment it stops satisfying the predicate. Until then, the operator downstream of the filter holds that pending retraction in memory, one per live row.
Filter (#20 < #21) |
| **Join** | Returns combinations of rows from each input whenever some equality predicates are true. **Can increase data size:** Depends on the join order and facts about the joined collections. **Uses memory:** ✅ The Join operator itself uses memory only for type=differential with more than 2 inputs. However, Join operators need arrangements on their inputs (shown by the ArrangeBy operator). These arrangements use memory proportional to the input sizes. If an input has an appropriate index, then the arrangement of the index will be reused. | Join on=(#1 = #2) type=delta |
| **CrossJoin** | An alias for a Join with an empty predicate (emits all combinations). Note that not all cross joins are marked as CrossJoin: In a join with more than 2 inputs, it can happen that there is a cross join between some of the inputs. You can recognize this case by ArrangeBy operators having empty keys, i.e., ArrangeBy keys=[[]]. **Can increase data size:** Cartesian product of the inputs (\|N\| x \|M\|). **Uses memory:** ✅ Uses memory for 3-way or more differential joins. | CrossJoin type=differential |
| **Reduce** | Groups the input rows by some scalar expressions, reduces each group using some aggregate functions, and produces rows containing the group key and aggregate outputs. **Can increase data size:** No **Uses memory:** ✅ SUM, COUNT, and most other aggregations use a moderate amount of memory (proportional either to twice the output size or to input size + output size). MIN and MAX aggregates can use significantly more memory. This can be improved by including group size hints in the query, see mz_introspection.mz_expected_group_size_advice. A hint shrinks the tower of intermediate arrangements, and shows in the optimized plan as exp_group_size and in the physical plan as the buckets list. The input rows stay arranged either way, so a hint cannot bring a MIN or MAX below the size of its input. | Reduce group_by=[#0] aggregates=[max((#0 * #1))] |
| **Distinct** | Alias for a Reduce with an empty aggregate list. **Can increase data size:** No **Uses memory:** ✅ Uses memory proportional to twice the output size. | Distinct |
| **TopK** | Groups the input rows by some scalar expressions, sorts each group by the ordering expressions, removes the top offset rows in each group, and returns the next limit rows. **Can increase data size:** No **Uses memory:** ✅ Can use significant amount as the operator can significantly overestimate the group sizes. Consult mz_introspection.mz_expected_group_size_advice. A LIMIT INPUT GROUP SIZE hint shows in the optimized plan as exp_group_size; the physical plan does not display it. | TopK order_by=[#1 asc nulls_last, #0 desc nulls_first] limit=5 |
| **Negate** | Negates the row counts of the input. This is usually used in combination with union to remove rows from the other union input. **Can increase data size:** No **Uses memory:** No | Negate |
| **Threshold** | Removes any rows with negative counts. **Can increase data size:** No **Uses memory:** ✅ Arranges both its input and its output by the whole row, so it uses memory proportional to the input size plus the output size. | Threshold |
| **Union** | Sums the counts of each row of all inputs. (Corresponds to UNION ALL rather than UNION/UNION DISTINCT.) **Can increase data size:** No **Uses memory:** ✅ A plain Union uses no memory of its own. A Union whose output must be consolidated holds updates while consolidating them, which shows as a memory spike largely at hydration time. | Union |
| **ArrangeBy** | Indicates a point that will become an arrangement in the dataflow engine (each keys element will be a different arrangement). Note that if an appropriate index already exists on the input or the output of the previous operator is already arranged with a key that is also requested here, then this operator will just pass on that existing arrangement instead of creating a new one. **Can increase data size:** No **Uses memory:** ✅ Depends. If arrangements need to be created, they use memory proportional to the input size. | ArrangeBy keys=[[#0]] |
| **With ... Return ...** | Introduces CTEs, i.e., makes it possible for sub-plans to be consumed multiple times by downstream operators. **Can increase data size:** No **Uses memory:** No | See Reading plans |
**Notes:**
- **Can increase data size:** Specifies whether the operator can increase the data size (can be the number of rows or the number of columns).
- **Uses memory:** Specifies whether the operator use memory to maintain state for its inputs.
**In raw plans:**
The following table lists the operators that are available in the raw plan.
- For those operators that require memory to maintain intermediate state, **Uses memory** is marked with **Yes**.
- For those operators that expand the data size (either rows or columns), **Can increase data size** is marked with **Yes**.| Operator | Description | Example |
| --- | --- | --- |
| **Constant** | Always produces the same collection of rows. **Can increase data size:** No **Uses memory:** No | Constant - ((1, 2) x 2) - (3, 4) Get materialize.public.ordered |
| **Project** | Produces a subset of the columns in the input rows. See also column numbering. **Can increase data size:** No **Uses memory:** No | Project (#2, #3) |
| **Map** | Appends the results of some scalar expressions to each row in the input. **Can increase data size:** Each row has more data (i.e., longer rows but same number of rows). **Uses memory:** No | Map (((#1 * 10000000dec) / #2) * 1000dec) |
| **CallTable** | Appends the result of some (one-to-many) table function to each row in the input. **Can increase data size:** Depends on the table function used. **Uses memory:** No | CallTable generate_series(1, 7, 1) |
| **Filter** | Removes rows of the input for which some scalar predicates return false.
A temporal filter, one whose predicate uses mz_now(), also schedules a retraction of each row for the moment it stops satisfying the predicate. Until then, the operator downstream of the filter holds that pending retraction in memory, one per live row.
Filter (#20 < #21) |
| **~Join** | Performs one of INNER / LEFT / RIGHT / FULL OUTER / CROSS join on the two inputs, using the given predicate. **Can increase data size:** For CrossJoins, Cartesian product of the inputs (\|N\| x \|M\|). Note that, in many cases, a join that shows up as a cross join in the RAW PLAN will actually be turned into an inner join in the OPTIMIZED PLAN, by making use of an equality WHERE condition. For other join types, depends on the join order and facts about the joined collections. **Uses memory:** ✅ Uses memory proportional to the input sizes, unless the inputs have appropriate indexes. Certain joins with more than 2 inputs use additional memory, see details in the optimized plan. | InnerJoin (#0 = #2) |
| **Reduce** | Groups the input rows by some scalar expressions, reduces each group using some aggregate functions, and produces rows containing the group key and aggregate outputs. In the case where the group key is empty and the input is empty, returns a single row with the aggregate functions applied to the empty input collection. **Can increase data size:** No **Uses memory:** ✅ SUM, COUNT, and most other aggregations use a moderate amount of memory (proportional either to twice the output size or to input size + output size). MIN and MAX aggregates can use significantly more memory. This can be improved by including group size hints in the query, see mz_introspection.mz_expected_group_size_advice. A hint shrinks the tower of intermediate arrangements, and shows in the optimized plan as exp_group_size and in the physical plan as the buckets list. The input rows stay arranged either way, so a hint cannot bring a MIN or MAX below the size of its input. | Reduce group_by=[#0] aggregates=[max((#0 * #1))] |
| **Distinct** | Removes duplicate copies of input rows. **Can increase data size:** No **Uses memory:** ✅ Uses memory proportional to twice the output size. | Distinct |
| **TopK** | Groups the input rows by some scalar expressions, sorts each group by the ordering expressions, removes the top offset rows in each group, and returns the next limit rows. **Can increase data size:** No **Uses memory:** ✅ Can use significant amount as the operator can significantly overestimate the group sizes. Consult mz_introspection.mz_expected_group_size_advice. A LIMIT INPUT GROUP SIZE hint shows in the optimized plan as exp_group_size; the physical plan does not display it. | TopK order_by=[#1 asc nulls_last, #0 desc nulls_first] limit=5 |
| **Negate** | Negates the row counts of the input. This is usually used in combination with union to remove rows from the other union input. **Can increase data size:** No **Uses memory:** No | Negate |
| **Threshold** | Removes any rows with negative counts. **Can increase data size:** No **Uses memory:** ✅ Arranges both its input and its output by the whole row, so it uses memory proportional to the input size plus the output size. | Threshold |
| **Union** | Sums the counts of each row of all inputs. (Corresponds to UNION ALL rather than UNION/UNION DISTINCT.) **Can increase data size:** No **Uses memory:** ✅ A plain Union uses no memory of its own. A Union whose output must be consolidated holds updates while consolidating them, which shows as a memory spike largely at hydration time. | Union |
| **With ... Return ...** | Introduces CTEs, i.e., makes it possible for sub-plans to be consumed multiple times by downstream operators. **Can increase data size:** No **Uses memory:** No | See Reading plans |
**Notes:**
- **Can increase data size:** Specifies whether the operator can increase the data size (can be the number of rows or the number of columns).
- **Uses memory:** Specifies whether the operator use memory to maintain state for its inputs.
Operators are sometimes marked as `Fused ...`. This indicates that the operator is fused with its input, i.e., the operator below it. That is, if you see a `Fused X` operator above a `Y` operator:
```
→Fused X
→Y
```
Then the `X` and `Y` operators will be combined into a single, more efficient operator.
See also:
- [`EXPLAIN PLAn`](/sql/explain-plan/)