Apache DataFusion SQL Query Engine
refactor: moving WindowTopN before EnsureRequirements (#24191)
Saad Tajwar0ef1aaabdf46
diff --git a/datafusion/core/src/optimizer_rule_reference.md b/datafusion/core/src/optimizer_rule_reference.mdindex 7652c2dcae..1367ed0843 100644--- a/datafusion/core/src/optimizer_rule_reference.md+++ b/datafusion/core/src/optimizer_rule_reference.md@@ -75,10 +75,10 @@ in multiple phases.| 3 | `join_selection` | - | Chooses join implementation, build side, and partition mode from statistics and stream properties. || 4 | `LimitedDistinctAggregation` | - | Pushes limit hints into grouped distinct-style aggregations when only a small result is needed. || 5 | `FilterPushdown` | pre-optimization phase | Pushes supported physical filters down toward data sources before distribution and sorting are enforced. |-| 6 | `EnsureRequirements` | - | Enforces both distribution and sorting requirements in a single idempotent rule. |-| 7 | `CombinePartialFinalAggregate` | - | Collapses adjacent partial and final aggregates when the distributed shape makes them redundant. |-| 8 | `OptimizeAggregateOrder` | - | Updates aggregate expressions to use the best ordering once sort requirements are known. |-| 9 | `WindowTopN` | - | Replaces eligible row-number window and filter patterns with per-partition TopK execution. |+| 6 | `WindowTopN` | - | Replaces eligible row-number window and filter patterns with per-partition TopK execution. |+| 7 | `EnsureRequirements` | - | Enforces both distribution and sorting requirements in a single idempotent rule. |+| 8 | `CombinePartialFinalAggregate` | - | Collapses adjacent partial and final aggregates when the distributed shape makes them redundant. |+| 9 | `OptimizeAggregateOrder` | - | Updates aggregate expressions to use the best ordering once sort requirements are known. || 10 | `ProjectionPushdown` | early pass | Pushes projections toward inputs before later physical rewrites add more limit and TopK structure. || 11 | `OutputRequirements` | remove phase | Removes the temporary output-requirement helper nodes after requirement-sensitive planning is done. || 12 | `LimitAggregation` | - | Passes a limit hint into eligible aggregations so they can keep fewer accumulator buckets. |diff --git a/datafusion/core/tests/physical_optimizer/window_topn.rs b/datafusion/core/tests/physical_optimizer/window_topn.rsindex 07a1db127e..be78b77b32 100644--- a/datafusion/core/tests/physical_optimizer/window_topn.rs+++ b/datafusion/core/tests/physical_optimizer/window_topn.rs@@ -64,7 +64,9 @@ fn optimize_disabled(plan: Arc<dyn ExecutionPlan>) -> Result<Arc<dyn ExecutionPlWindowTopN::new().optimize(plan, &config)}-/// Build: FilterExec(rn <= limit) → BoundedWindowAggExec(ROW_NUMBER PBY pk OBY val) → SortExec(pk, val)+/// Build: FilterExec(rn <= limit) → BoundedWindowAggExec(ROW_NUMBER PBY pk OBY val)+///+/// Matches the pre-`EnsureRequirements` plan shape (no `SortExec` under the window).fn build_window_topn_plan(limit_value: i64,op: Operator,@@ -72,16 +74,6 @@ fn build_window_topn_plan(let s = schema();let input: Arc<dyn ExecutionPlan> = Arc::new(PlaceholderRowExec::new(Arc::clone(&s)));- // Sort by pk ASC, val ASC- let ordering = LexOrdering::new(vec![- PhysicalSortExpr::new_default(col("pk", &s)?).asc(),- PhysicalSortExpr::new_default(col("val", &s)?).asc(),- ])- .unwrap();-- let sort: Arc<dyn ExecutionPlan> =- Arc::new(SortExec::new(ordering.clone(), input).with_preserve_partitioning(true));-// ROW_NUMBER() OVER (PARTITION BY pk ORDER BY val)let partition_by = vec![col("pk", &s)?];let order_by = vec![PhysicalSortExpr::new_default(col("val", &s)?).asc()];@@ -105,7 +97,7 @@ fn build_window_topn_plan(let window: Arc<dyn ExecutionPlan> = Arc::new(BoundedWindowAggExec::try_new(vec![window_expr],- sort,+ input,InputOrderMode::Sorted,true,)?);@@ -252,16 +244,6 @@ fn flipped_3_gteq_rn() -> Result<()> {let input: Arc<dyn ExecutionPlan> =Arc::new(PlaceholderRowExec::new(Arc::clone(&s)));- let ordering = LexOrdering::new(vec![- PhysicalSortExpr::new_default(col("pk", &s)?).asc(),- PhysicalSortExpr::new_default(col("val", &s)?).asc(),- ])- .unwrap();-- let sort: Arc<dyn ExecutionPlan> = Arc::new(- SortExec::new(ordering.clone(), input).with_preserve_partitioning(true),- );-let partition_by = vec![col("pk", &s)?];let order_by = vec![PhysicalSortExpr::new_default(col("val", &s)?).asc()];@@ -284,7 +266,7 @@ fn flipped_3_gteq_rn() -> Result<()> {let window: Arc<dyn ExecutionPlan> = Arc::new(BoundedWindowAggExec::try_new(vec![window_expr],- sort,+ input,InputOrderMode::Sorted,true,)?);@@ -353,15 +335,6 @@ fn with_projection_between() -> Result<()> {let s = schema();let input: Arc<dyn ExecutionPlan> = Arc::new(PlaceholderRowExec::new(Arc::clone(&s)));- let ordering = LexOrdering::new(vec![- PhysicalSortExpr::new_default(col("pk", &s)?).asc(),- PhysicalSortExpr::new_default(col("val", &s)?).asc(),- ])- .unwrap();-- let sort: Arc<dyn ExecutionPlan> =- Arc::new(SortExec::new(ordering.clone(), input).with_preserve_partitioning(true));-let partition_by = vec![col("pk", &s)?];let order_by = vec![PhysicalSortExpr::new_default(col("val", &s)?).asc()];@@ -384,7 +357,7 @@ fn with_projection_between() -> Result<()> {let window: Arc<dyn ExecutionPlan> = Arc::new(BoundedWindowAggExec::try_new(vec![window_expr],- sort,+ input,InputOrderMode::Sorted,true,)?);@@ -429,7 +402,9 @@ fn with_projection_between() -> Result<()> {// RANK rule tests// -----------------------------------------------------------------------/// Build: FilterExec(rk op limit) → BoundedWindowAggExec(<udwf> PBY pk OBY val) → SortExec(pk, val)+/// Build: FilterExec(rk op limit) → BoundedWindowAggExec(<udwf> PBY pk OBY val)+///+/// Matches the pre-`EnsureRequirements` plan shape (no `SortExec` under the window).////// `udwf_factory` selects the window UDWF (rank, dense_rank, ...) and/// `udwf_name` is the column name produced by that UDWF (matters because@@ -444,15 +419,6 @@ fn build_ranking_topn_plan(let s = schema();let input: Arc<dyn ExecutionPlan> = Arc::new(PlaceholderRowExec::new(Arc::clone(&s)));- let ordering = LexOrdering::new(vec![- PhysicalSortExpr::new_default(col("pk", &s)?).asc(),- PhysicalSortExpr::new_default(col("val", &s)?).asc(),- ])- .unwrap();-- let sort: Arc<dyn ExecutionPlan> =- Arc::new(SortExec::new(ordering.clone(), input).with_preserve_partitioning(true));-let partition_by = vec![col("pk", &s)?];let order_by = vec![PhysicalSortExpr::new_default(col("val", &s)?).asc()];@@ -469,7 +435,7 @@ fn build_ranking_topn_plan(let window: Arc<dyn ExecutionPlan> = Arc::new(BoundedWindowAggExec::try_new(vec![window_expr],- sort,+ input,InputOrderMode::Sorted,true,)?);diff --git a/datafusion/physical-optimizer/src/optimizer.rs b/datafusion/physical-optimizer/src/optimizer.rsindex 2841afecf6..aed25546cd 100644--- a/datafusion/physical-optimizer/src/optimizer.rs+++ b/datafusion/physical-optimizer/src/optimizer.rs@@ -109,6 +109,12 @@ impl PhysicalOptimizer {// those are handled by the later `FilterPushdown` rule.// See `FilterPushdownPhase` for more details.Arc::new(FilterPushdown::new()),+ // WindowTopN: replaces Filter(rn<=K) → Window(ROW_NUMBER)+ // with Window(ROW_NUMBER) → PartitionedTopKExec(fetch=K).+ // Must run before EnsureRequirements (so it can rewrite against the+ // window's declared ordering without pattern-matching a SortExec)+ // and before ProjectionPushdown (which embeds projections into FilterExec).+ Arc::new(WindowTopN::new()),// Ensures each input plan satisfies the distribution and ordering// requirements declared by `ExecutionPlan::required_input_distribution`// and `ExecutionPlan::required_input_ordering`.@@ -132,11 +138,6 @@ impl PhysicalOptimizer {Arc::new(CombinePartialFinalAggregate::new()),// Run once after the local sorting requirement is changedArc::new(OptimizeAggregateOrder::new()),- // WindowTopN: replaces Filter(rn<=K) → Window(ROW_NUMBER) → Sort- // with Window(ROW_NUMBER) → PartitionedTopKExec(fetch=K).- // Must run after EnsureRequirements (which inserts SortExec) and before- // ProjectionPushdown (which embeds projections into FilterExec).- Arc::new(WindowTopN::new()),// TODO: `try_embed_to_hash_join` in the ProjectionPushdown rule would be block by the CoalesceBatches, so add it before CoalesceBatches. Maybe optimize it in the future.Arc::new(ProjectionPushdown::new()),// Remove the ancillary output requirement operator since we are done with the planningdiff --git a/datafusion/physical-optimizer/src/window_topn.rs b/datafusion/physical-optimizer/src/window_topn.rsindex c668608ca2..29b8f4a460 100644--- a/datafusion/physical-optimizer/src/window_topn.rs+++ b/datafusion/physical-optimizer/src/window_topn.rs@@ -35,9 +35,9 @@//! ) WHERE rk <= K;//! ```//!-//! And replaces the `FilterExec → BoundedWindowAggExec → SortExec` pipeline-//! with `BoundedWindowAggExec → PartitionedTopKExec(fetch=K)`, removing both-//! the `FilterExec` and `SortExec`.+//! And replaces the `FilterExec → BoundedWindowAggExec` pipeline with+//! `BoundedWindowAggExec → PartitionedTopKExec(fetch=K)`, removing the+//! `FilterExec` and inserting `PartitionedTopKExec` under the window.//!//! The appropriate [`WindowFnKind`] is forwarded to `PartitionedTopKExec`.//! RANK requires a non-empty `ORDER BY` clause (otherwise all rows tie at@@ -58,6 +58,7 @@ use datafusion_common::{Result, ScalarValue};use datafusion_expr::Operator;use datafusion_physical_expr::expressions::{BinaryExpr, Column, Literal};use datafusion_physical_expr::window::StandardWindowExpr;+use datafusion_physical_expr::{LexOrdering, PhysicalSortExpr};use datafusion_physical_plan::ExecutionPlan;use datafusion_physical_plan::filter::FilterExec;use datafusion_physical_plan::projection::ProjectionExec;@@ -65,7 +66,6 @@ use datafusion_physical_plan::repartition::RepartitionExec;use datafusion_physical_plan::sorts::partitioned_topk::{PartitionedTopKExec, WindowFnKind,};-use datafusion_physical_plan::sorts::sort::SortExec;use datafusion_physical_plan::windows::{BoundedWindowAggExec, WindowUDFExpr};/// Physical optimizer rule that converts per-partition `ROW_NUMBER` and@@ -78,7 +78,6 @@ use datafusion_physical_plan::windows::{BoundedWindowAggExec, WindowUDFExpr};/// FilterExec(<ranking fn output> <= K)/// [optional ProjectionExec]/// BoundedWindowAggExec(<ranking fn> PARTITION BY ... ORDER BY ...)-/// SortExec(partition_keys, order_keys)/// ```////// # Replacement@@ -89,7 +88,7 @@ use datafusion_physical_plan::windows::{BoundedWindowAggExec, WindowUDFExpr};/// PartitionedTopKExec(fn=<row_number|rank>, partition_keys, order_keys, fetch=K)/// ```///-/// The `FilterExec` is removed entirely. The `SortExec` is replaced by+/// The `FilterExec` is removed entirely. The child of `BoundedWindowAggExec` is now/// `PartitionedTopKExec`, which maintains a per-partition top-K heap (and,/// for `RANK`, a sibling ties `Vec`) instead of sorting the whole dataset.///@@ -104,7 +103,7 @@ use datafusion_physical_plan::windows::{BoundedWindowAggExec, WindowUDFExpr};////// All of the following must be true:/// - Config flag `enable_window_topn` is `true`-/// - The plan matches `FilterExec → [ProjectionExec] → BoundedWindowAggExec → SortExec`+/// - The plan matches `FilterExec → [ProjectionExec] → BoundedWindowAggExec`/// - The window function is `ROW_NUMBER` or `RANK` (not `DENSE_RANK`)/// - The window function has a `PARTITION BY` clause (global top-K is/// already handled by `SortExec` with `fetch`)@@ -126,7 +125,7 @@ impl WindowTopN {/// Attempt to transform a single plan node.////// Returns `Some(new_plan)` if the node matches the- /// `FilterExec → [ProjectionExec] → BoundedWindowAggExec → SortExec`+ /// `FilterExec → [ProjectionExec] → BoundedWindowAggExec`/// pattern and can be rewritten, or `None` if the node should be/// left unchanged.fn try_transform(plan: &Arc<dyn ExecutionPlan>) -> Option<Arc<dyn ExecutionPlan>> {@@ -147,7 +146,6 @@ impl WindowTopN {// Step 4: Verify col_idx references a supported window function output columnlet window_exec_typed = window_exec.downcast_ref::<BoundedWindowAggExec>()?;- let sort_exec = window_exec_typed.input().downcast_ref::<SortExec>()?;let input_field_count = window_exec_typed.input().schema().fields().len();if col_idx < input_field_count {return None; // Filter is on an input column, not a window column@@ -159,10 +157,7 @@ impl WindowTopN {}let fn_kind = supported_window_fn(&window_exprs[window_expr_idx])?;- // Step 5: child of window is SortExec (verified above)- let sort_child = sort_exec.input();-- // Step 6: Determine partition_prefix_len from the window expression+ // Step 5: Validate PARTITION BY / ORDER BY and collect sort keys from the window exprlet partition_by = window_exprs[window_expr_idx].partition_by();let partition_prefix_len = partition_by.len();@@ -175,28 +170,33 @@ impl WindowTopN {// For RANK: an empty ORDER BY makes every row tie at rank 1 —// the optimization is degenerate (we'd retain the entire input)// and tie storage would be unbounded.- if matches!(fn_kind, WindowFnKind::Rank)- && window_exprs[window_expr_idx].order_by().is_empty()- {+ let order_by = window_exprs[window_expr_idx].order_by();+ if matches!(fn_kind, WindowFnKind::Rank) && order_by.is_empty() {return None;}- // Step 7: Build PartitionedTopKExec using SortExec's expressions+ // Step 6: Build PartitionedTopKExec from the window's partition/order keys+ let expr_iterator = partition_by+ .iter()+ .map(|e| PhysicalSortExpr::new_default(Arc::clone(e)))+ .chain(order_by.iter().cloned());+ let expr = LexOrdering::new(expr_iterator)?;+let partitioned_topk = PartitionedTopKExec::try_new(- Arc::clone(sort_child),- sort_exec.expr().clone(),+ Arc::clone(window_exec_typed.input()),+ expr,partition_prefix_len,limit_n,fn_kind,).ok()?;- // Step 8: Rebuild window with new child+ // Step 7: Rebuild window with PartitionedTopKExec as its childlet mut result = window_exec.with_new_children(vec![Arc::new(partitioned_topk)]).ok()?;- // Step 9: Rebuild intermediate nodes (ProjectionExec/RepartitionExec)+ // Step 8: Rebuild intermediate nodes (ProjectionExec/RepartitionExec)for node in intermediates.into_iter().rev() {result = node.with_new_children(vec![result]).ok()?;}diff --git a/datafusion/sqllogictest/test_files/explain.slt b/datafusion/sqllogictest/test_files/explain.sltindex 5405c7ce0e..b683700208 100644--- a/datafusion/sqllogictest/test_files/explain.slt+++ b/datafusion/sqllogictest/test_files/explain.slt@@ -237,10 +237,10 @@ physical_plan after aggregate_statistics SAME TEXT AS ABOVEphysical_plan after join_selection SAME TEXT AS ABOVEphysical_plan after LimitedDistinctAggregation SAME TEXT AS ABOVEphysical_plan after FilterPushdown SAME TEXT AS ABOVE+physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after EnsureRequirements SAME TEXT AS ABOVEphysical_plan after CombinePartialFinalAggregate SAME TEXT AS ABOVEphysical_plan after OptimizeAggregateOrder SAME TEXT AS ABOVE-physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after ProjectionPushdown SAME TEXT AS ABOVEphysical_plan after OutputRequirements DataSourceExec: file_groups={1 group: [[WORKSPACE_ROOT/datafusion/core/tests/data/example.csv]]}, projection=[a, b, c], file_type=csv, has_header=truephysical_plan after LimitAggregation SAME TEXT AS ABOVE@@ -317,10 +317,10 @@ physical_plan after aggregate_statistics SAME TEXT AS ABOVEphysical_plan after join_selection SAME TEXT AS ABOVEphysical_plan after LimitedDistinctAggregation SAME TEXT AS ABOVEphysical_plan after FilterPushdown SAME TEXT AS ABOVE+physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after EnsureRequirements SAME TEXT AS ABOVEphysical_plan after CombinePartialFinalAggregate SAME TEXT AS ABOVEphysical_plan after OptimizeAggregateOrder SAME TEXT AS ABOVE-physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after ProjectionPushdown SAME TEXT AS ABOVEphysical_plan after OutputRequirements01)GlobalLimitExec: skip=0, fetch=10, statistics=[Rows=Exact(8), Bytes=Absent, [(Col[0]: ScanBytes=Exact(32)),(Col[1]: ScanBytes=Inexact(24)),(Col[2]: ScanBytes=Exact(32)),(Col[3]: ScanBytes=Exact(32)),(Col[4]: ScanBytes=Exact(32)),(Col[5]: ScanBytes=Exact(64)),(Col[6]: ScanBytes=Exact(32)),(Col[7]: ScanBytes=Exact(64)),(Col[8]: ScanBytes=Inexact(88)),(Col[9]: ScanBytes=Inexact(49)),(Col[10]: ScanBytes=Exact(64))]]@@ -363,10 +363,10 @@ physical_plan after aggregate_statistics SAME TEXT AS ABOVEphysical_plan after join_selection SAME TEXT AS ABOVEphysical_plan after LimitedDistinctAggregation SAME TEXT AS ABOVEphysical_plan after FilterPushdown SAME TEXT AS ABOVE+physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after EnsureRequirements SAME TEXT AS ABOVEphysical_plan after CombinePartialFinalAggregate SAME TEXT AS ABOVEphysical_plan after OptimizeAggregateOrder SAME TEXT AS ABOVE-physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after ProjectionPushdown SAME TEXT AS ABOVEphysical_plan after OutputRequirements01)GlobalLimitExec: skip=0, fetch=10@@ -616,10 +616,10 @@ physical_plan after aggregate_statistics SAME TEXT AS ABOVEphysical_plan after join_selection SAME TEXT AS ABOVEphysical_plan after LimitedDistinctAggregation SAME TEXT AS ABOVEphysical_plan after FilterPushdown SAME TEXT AS ABOVE+physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after EnsureRequirements SAME TEXT AS ABOVEphysical_plan after CombinePartialFinalAggregate SAME TEXT AS ABOVEphysical_plan after OptimizeAggregateOrder SAME TEXT AS ABOVE-physical_plan after WindowTopN SAME TEXT AS ABOVEphysical_plan after ProjectionPushdown SAME TEXT AS ABOVEphysical_plan after OutputRequirements DataSourceExec: file_groups={1 group: [[WORKSPACE_ROOT/datafusion/core/tests/data/example.csv]]}, projection=[a, b, c], file_type=csv, has_header=truephysical_plan after LimitAggregation SAME TEXT AS ABOVEdiff --git a/datafusion/sqllogictest/test_files/window_topn.slt b/datafusion/sqllogictest/test_files/window_topn.sltindex 4dff4a779b..44cb31153b 100644--- a/datafusion/sqllogictest/test_files/window_topn.slt+++ b/datafusion/sqllogictest/test_files/window_topn.slt@@ -64,8 +64,9 @@ logical_planphysical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test 3: rn < 4 should give same results (fetch=3)query III rowsort@@ -131,8 +132,9 @@ logical_planphysical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test 7: Filter on data column (not window output) — should NOT optimizequery TT@@ -164,8 +166,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]statement okSET datafusion.explain.physical_plan_only = false;@@ -233,23 +236,32 @@ physical_plan30)│ CURRENT ROW │31)└─────────────┬─────────────┘32)┌─────────────┴─────────────┐-33)│ PartitionedTopKExec │+33)│ RepartitionExec │34)│ -------------------- │-35)│ fetch: 3 │-36)│ fn: row_number │+35)│ partition_count(in->out): │+36)│ 1 -> 4 │37)│ │-38)│ order: │-39)│ [val@2 ASC NULLS LAST] │-40)│ │-41)│ partition: [pk@1] │-42)└─────────────┬─────────────┘-43)┌─────────────┴─────────────┐-44)│ DataSourceExec │-45)│ -------------------- │-46)│ bytes: 480 │-47)│ format: memory │-48)│ rows: 1 │-49)└───────────────────────────┘+38)│ partitioning_scheme: │+39)│ Hash([pk@1], 4) │+40)└─────────────┬─────────────┘+41)┌─────────────┴─────────────┐+42)│ PartitionedTopKExec │+43)│ -------------------- │+44)│ fetch: 3 │+45)│ fn: row_number │+46)│ │+47)│ order: │+48)│ [val@2 ASC NULLS LAST] │+49)│ │+50)│ partition: [pk@1] │+51)└─────────────┬─────────────┘+52)┌─────────────┴─────────────┐+53)│ DataSourceExec │+54)│ -------------------- │+55)│ bytes: 480 │+56)│ format: memory │+57)│ rows: 1 │+58)└───────────────────────────┘statement okSET datafusion.explain.format = indent;@@ -310,8 +322,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn, rank() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@4 as rnk]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW, rank() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "rank() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test 14: Filter on rn AND rnk — compound predicate should NOT optimizequery TT@@ -360,8 +373,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk, window_topn_t.id] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk, window_topn_t.id] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk, window_topn_t.id] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1, id@0], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1, id@0], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1, id@0], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]statement okSET datafusion.explain.physical_plan_only = false;@@ -391,8 +405,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.id] ORDER BY [window_topn_t.id ASC NULLS LAST, window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.id] ORDER BY [window_topn_t.id ASC NULLS LAST, window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.id] ORDER BY [window_topn_t.id ASC NULLS LAST, window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[id@0], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([id@0], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[id@0], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test 19: Overlapping keys correctness (each id is unique, so rn=1 for all)statement ok@@ -426,8 +441,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.pk ASC NULLS LAST, window_topn_t.val DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.pk ASC NULLS LAST, window_topn_t.val DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.pk ASC NULLS LAST, window_topn_t.val DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 DESC]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 DESC]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test 21: Correctness for PARTITION BY pk ORDER BY pk, val DESCstatement ok@@ -460,8 +476,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.pk DESC NULLS FIRST, window_topn_t.val DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.pk DESC NULLS FIRST, window_topn_t.val DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.pk DESC NULLS FIRST, window_topn_t.val DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 DESC]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 DESC]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]statement okSET datafusion.explain.physical_plan_only = false;@@ -494,8 +511,9 @@ QUALIFY rn <= 3;physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test 30: QUALIFY with < operatorstatement ok@@ -523,8 +541,9 @@ QUALIFY rnk <= 3;physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, rank() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rnk]02)--BoundedWindowAggExec: wdw=[rank() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "rank() PARTITION BY [window_topn_t.pk] ORDER BY [window_topn_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]statement okSET datafusion.explain.physical_plan_only = false;@@ -600,8 +619,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_nulls.pk] ORDER BY [window_topn_nulls.val ASC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_nulls.pk] ORDER BY [window_topn_nulls.val ASC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_nulls.pk] ORDER BY [window_topn_nulls.val ASC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=2, partition=[pk@1], order=[val@2 ASC]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=2, partition=[pk@1], order=[val@2 ASC]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]query TTEXPLAIN SELECT * FROM (@@ -611,8 +631,9 @@ EXPLAIN SELECT * FROM (physical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, row_number() PARTITION BY [window_topn_nulls.pk] ORDER BY [window_topn_nulls.val DESC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rn]02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [window_topn_nulls.pk] ORDER BY [window_topn_nulls.val DESC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [window_topn_nulls.pk] ORDER BY [window_topn_nulls.val DESC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=row_number, fetch=2, partition=[pk@1], order=[val@2 DESC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=row_number, fetch=2, partition=[pk@1], order=[val@2 DESC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]statement okSET datafusion.explain.physical_plan_only = false;@@ -693,8 +714,9 @@ logical_planphysical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, rank() PARTITION BY [window_topn_rank_t.pk] ORDER BY [window_topn_rank_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rk]02)--BoundedWindowAggExec: wdw=[rank() PARTITION BY [window_topn_rank_t.pk] ORDER BY [window_topn_rank_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "rank() PARTITION BY [window_topn_rank_t.pk] ORDER BY [window_topn_rank_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test R3: rk < 4 should give the same results (fetch = K-1 = 3)query III rowsort@@ -800,8 +822,9 @@ logical_planphysical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, rank() PARTITION BY [window_topn_rank_t.pk, window_topn_rank_t.id] ORDER BY [window_topn_rank_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rk]02)--BoundedWindowAggExec: wdw=[rank() PARTITION BY [window_topn_rank_t.pk, window_topn_rank_t.id] ORDER BY [window_topn_rank_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "rank() PARTITION BY [window_topn_rank_t.pk, window_topn_rank_t.id] ORDER BY [window_topn_rank_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=rank, fetch=1, partition=[pk@1, id@0], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1, id@0], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=rank, fetch=1, partition=[pk@1, id@0], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test R9: RANK with DESC orderingquery III rowsort@@ -940,8 +963,9 @@ logical_planphysical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, rank() PARTITION BY [window_topn_rank_dense_t.pk] ORDER BY [window_topn_rank_dense_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rk]02)--BoundedWindowAggExec: wdw=[rank() PARTITION BY [window_topn_rank_dense_t.pk] ORDER BY [window_topn_rank_dense_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "rank() PARTITION BY [window_topn_rank_dense_t.pk] ORDER BY [window_topn_rank_dense_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=rank, fetch=3, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]statement okDROP TABLE window_topn_rank_dense_t;@@ -1008,8 +1032,9 @@ logical_planphysical_plan01)ProjectionExec: expr=[id@0 as id, pk@1 as pk, val@2 as val, rank() PARTITION BY [window_topn_rank_null_t.pk] ORDER BY [window_topn_rank_null_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@3 as rk]02)--BoundedWindowAggExec: wdw=[rank() PARTITION BY [window_topn_rank_null_t.pk] ORDER BY [window_topn_rank_null_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "rank() PARTITION BY [window_topn_rank_null_t.pk] ORDER BY [window_topn_rank_null_t.val ASC NULLS LAST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-03)----PartitionedTopKExec: fn=rank, fetch=2, partition=[pk@1], order=[val@2 ASC NULLS LAST]-04)------DataSourceExec: partitions=1, partition_sizes=[1]+03)----RepartitionExec: partitioning=Hash([pk@1], 4), input_partitions=1, maintains_sort_order=true+04)------PartitionedTopKExec: fn=rank, fetch=2, partition=[pk@1], order=[val@2 ASC NULLS LAST]+05)--------DataSourceExec: partitions=1, partition_sizes=[1]# Test R19: DESC NULLS LAST — pk=1: 3,2,1,NULL ranks 1,2,3,4; pk=2: 5,NULL,NULL ranks 1,2,2.query III rowsort@@ -1073,10 +1098,12 @@ logical_plan04)------TableScan: t projection=[c1, c2]physical_plan01)ProjectionExec: expr=[c1@0 as c1, c2@1 as c2, row_number() PARTITION BY [t.c1] ORDER BY [t.c2 DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW@2 as rn]-02)--RepartitionExec: partitioning=RoundRobinBatch(5), input_partitions=1, maintains_sort_order=true-03)----BoundedWindowAggExec: wdw=[row_number() PARTITION BY [t.c1] ORDER BY [t.c2 DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [t.c1] ORDER BY [t.c2 DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]-04)------PartitionedTopKExec: fn=row_number, fetch=1, partition=[c1@0], order=[c2@1 DESC]-05)--------DataSourceExec: partitions=1, partition_sizes=[1]+02)--BoundedWindowAggExec: wdw=[row_number() PARTITION BY [t.c1] ORDER BY [t.c2 DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW: Field { "row_number() PARTITION BY [t.c1] ORDER BY [t.c2 DESC NULLS FIRST] RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW": UInt64 }, frame: RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW], mode=[Sorted]+03)----SortPreservingMergeExec: [c1@0 ASC NULLS LAST, c2@1 DESC]+04)------SortExec: expr=[c1@0 ASC NULLS LAST, c2@1 DESC], preserve_partitioning=[true]+05)--------PartitionedTopKExec: fn=row_number, fetch=1, partition=[c1@0], order=[c2@1 DESC]+06)----------RepartitionExec: partitioning=Hash([c1@0], 5), input_partitions=1+07)------------DataSourceExec: partitions=1, partition_sizes=[1]statement okset datafusion.execution.target_partitions = 4;