crp-order-qty-opt-service - Details for Query 4204

Submitted Time: 2026/08/10 12:33:09
Duration: 0.9 s
Succeeded Jobs: 6368 6369 6370

Plan Visualization

Show the Stage ID and Task ID that corresponds to the max metric

digraph G { subgraph cluster0 { isCluster="true"; id="cluster0"; label="WholeStageCodegen (6)\n \nduration: total (min, med, max (stageId: taskId))\n55 ms (0 ms, 5 ms, 6 ms (stage 82862.0: task 200110))"; tooltip="WholeStageCodegen (6)"; 1 [id="node1" labelType="html" label="HashAggregate spill size: 0.0 B time in aggregation build total (min, med, max (stageId: taskId)) 7 ms (0 ms, 0 ms, 2 ms (stage 82862.0: task 200104)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 82862.0: task 200109)) number of output rows: 0 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#981205], functions=[])"]; } 2 [id="node2" labelType="html" label="Exchange shuffle records written: 0 remote merged reqs duration: 0 ms remote merged blocks fetched: 0 records read: 0 local bytes read: 0.0 B merged fetch fallback count: 0 local blocks read: 0 remote merged chunks fetched: 0 remote blocks read: 0 data size: 0.0 B local merged bytes read: 0.0 B local merged chunks fetched: 0 shuffle write time: 0 ms remote merged bytes read: 0.0 B local merged blocks fetched: 0 corrupt merged block chunks: 0 fetch wait time: 0 ms remote bytes read: 0.0 B number of partitions: 20 remote reqs duration: 0 ms remote bytes read to disk: 0.0 B shuffle bytes written: 0.0 B" tooltip="Exchange hashpartitioning(shardId#981205, 20), ENSURE_REQUIREMENTS, [plan_id=382545]"]; subgraph cluster3 { isCluster="true"; id="cluster3"; label="WholeStageCodegen (5)\n \nduration: total (min, med, max (stageId: taskId))\n369 ms (0 ms, 33 ms, 40 ms (stage 82861.0: task 200089))"; tooltip="WholeStageCodegen (5)"; 4 [id="node4" labelType="html" label="HashAggregate spill size: 0.0 B time in aggregation build total (min, med, max (stageId: taskId)) 42 ms (0 ms, 3 ms, 5 ms (stage 82861.0: task 200089)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 82861.0: task 200082)) number of output rows: 0 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#981205], functions=[])"]; 5 [id="node5" labelType="html" label=" Project " tooltip="Project [shardId#981205]"]; 6 [id="node6" labelType="html" label="Generate number of output rows: 0" tooltip="Generate explode(optimizationInsights#981211), [shardId#981205], false, [insight#985339]"]; 7 [id="node7" labelType="html" label=" Project " tooltip="Project [shardId#981205, optimizationInsights#981211]"]; 8 [id="node8" labelType="html" label="BroadcastHashJoin number of output rows: 0" tooltip="BroadcastHashJoin [orderProposalId#981206L], [orderProposalId#981918L], Inner, BuildLeft, false"]; 19 [id="node19" labelType="html" label="HashAggregate spill size: 0.0 B time in aggregation build total (min, med, max (stageId: taskId)) 8 ms (0 ms, 0 ms, 2 ms (stage 82861.0: task 200083)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 82861.0: task 200082)) number of output rows: 5 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#981918L], functions=[])"]; } 9 [id="node9" labelType="html" label="BroadcastExchange time to broadcast: 0 ms time to build: 0 ms time to collect: 96 ms number of output rows: 0 data size: 0.0 B" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=382514]"]; subgraph cluster10 { isCluster="true"; id="cluster10"; label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n0 ms (0 ms, 0 ms, 0 ms (stage 82858.0: task 200025))"; tooltip="WholeStageCodegen (1)"; 11 [id="node11" labelType="html" label="Filter number of output rows: 0" tooltip="Filter ((isnotnull(orderProposalId#981206L) AND (size(optimizationInsights#981211, true) > 0)) AND isnotnull(optimizationInsights#981211))"]; } 12 [id="node12" labelType="html" label="InMemoryTableScan number of output rows: 5" tooltip="InMemoryTableScan [shardId#981205, orderProposalId#981206L, optimizationInsights#981211], [isnotnull(orderProposalId#981206L), (size(optimizationInsights#981211, true) > 0), isnotnull(optimizationInsights#981211)]"]; subgraph cluster13 { isCluster="true"; id="cluster13"; label="WholeStageCodegen (1)\n \nduration: 0 ms"; tooltip="WholeStageCodegen (1)"; 14 [id="node14" labelType="html" label="Filter number of output rows: 0" tooltip="Filter (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))"]; } 15 [id="node15" labelType="html" label="InMemoryTableScan number of output rows: 0" tooltip="InMemoryTableScan [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211], [isnotnull(shardId#981205), (shardId#981205 = 0_1_10000002110)]"]; subgraph cluster16 { isCluster="true"; id="cluster16"; label="WholeStageCodegen (1)\n \nduration: 0 ms"; tooltip="WholeStageCodegen (1)"; 17 [id="node17" labelType="html" label="Filter number of output rows: 0" tooltip="Filter (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))"]; 18 [id="node18" labelType="html" label="Scan ExistingRDD number of output rows: 0" tooltip="Scan ExistingRDD[shardId#981205,orderProposalId#981206L,items#981207,optimizationGroups#981208,isOptimal#981209,lastModified#981210,optimizationInsights#981211]"]; } 20 [id="node20" labelType="html" label="Exchange shuffle records written: 7 remote merged reqs duration: 0 ms remote merged blocks fetched: 0 records read: 7 local bytes read total (min, med, max (stageId: taskId)) 525.0 B (75.0 B, 150.0 B, 150.0 B (stage 82861.0: task 200082)) merged fetch fallback count: 0 local blocks read: 7 remote merged chunks fetched: 0 remote blocks read: 0 data size total (min, med, max (stageId: taskId)) 112.0 B (16.0 B, 16.0 B, 16.0 B (stage 82860.0: task 200061)) local merged bytes read: 0.0 B local merged chunks fetched: 0 shuffle write time total (min, med, max (stageId: taskId)) 2 ms (0 ms, 0 ms, 0 ms (stage 82860.0: task 200066)) remote merged bytes read: 0.0 B local merged blocks fetched: 0 corrupt merged block chunks: 0 fetch wait time total (min, med, max (stageId: taskId)) 0 ms (0 ms, 0 ms, 0 ms (stage 82861.0: task 200082)) remote bytes read: 0.0 B number of partitions: 20 remote reqs duration: 0 ms remote bytes read to disk: 0.0 B shuffle bytes written total (min, med, max (stageId: taskId)) 525.0 B (75.0 B, 75.0 B, 75.0 B (stage 82860.0: task 200061))" tooltip="Exchange hashpartitioning(orderProposalId#981918L, 20), ENSURE_REQUIREMENTS, [plan_id=382536]"]; subgraph cluster21 { isCluster="true"; id="cluster21"; label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n107 ms (0 ms, 10 ms, 11 ms (stage 82860.0: task 200068))"; tooltip="WholeStageCodegen (4)"; 22 [id="node22" labelType="html" label="HashAggregate spill size: 0.0 B time in aggregation build total (min, med, max (stageId: taskId)) 7 ms (0 ms, 0 ms, 2 ms (stage 82860.0: task 200064)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 82860.0: task 200068)) number of output rows: 7 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#981918L], functions=[])"]; 23 [id="node23" labelType="html" label=" Project " tooltip="Project [orderProposalId#981918L]"]; 24 [id="node24" labelType="html" label="BroadcastHashJoin number of output rows: 8" tooltip="BroadcastHashJoin [worklistShardItemId#981717L], [worklistShardItemId#981941L], Inner, BuildLeft, false"]; 38 [id="node38" labelType="html" label=" Project " tooltip="Project [worklistShardItemId#981941L, orderProposalId#981918L]"]; } 25 [id="node25" labelType="html" label="BroadcastExchange time to broadcast: 0 ms time to build: 1 ms time to collect: 56 ms number of output rows: 8 data size: 1024.2 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=382522]"]; subgraph cluster26 { isCluster="true"; id="cluster26"; label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n0 ms (0 ms, 0 ms, 0 ms (stage 82857.0: task 200021))"; tooltip="WholeStageCodegen (2)"; 27 [id="node27" labelType="html" label=" Project " tooltip="Project [item#981716L AS worklistShardItemId#981717L]"]; 28 [id="node28" labelType="html" label="Generate number of output rows: 8" tooltip="Generate explode(_extract_worklistShardItemId#985470), false, [item#981716L]"]; 29 [id="node29" labelType="html" label=" Project " tooltip="Project [items#985333.worklistShardItemId AS _extract_worklistShardItemId#985470]"]; 30 [id="node30" labelType="html" label="Filter number of output rows: 5" tooltip="Filter (((size(items#985333.worklistShardItemId, true) > 0) AND isnotnull(items#985333.worklistShardItemId)) AND (shardId#985331 = 0_1_10000002110))"]; } 31 [id="node31" labelType="html" label="InMemoryTableScan number of output rows: 5" tooltip="InMemoryTableScan [items#985333, shardId#985331], [(size(items#985333.worklistShardItemId, true) > 0), isnotnull(items#985333.worklistShardItemId), (shardId#985331 = 0_1_10000002110)]"]; subgraph cluster32 { isCluster="true"; id="cluster32"; label="WholeStageCodegen (1)\n \nduration: 0 ms"; tooltip="WholeStageCodegen (1)"; 33 [id="node33" labelType="html" label="Filter number of output rows: 0" tooltip="Filter (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))"]; } 34 [id="node34" labelType="html" label="InMemoryTableScan number of output rows: 0" tooltip="InMemoryTableScan [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211], [isnotnull(shardId#981205), (shardId#981205 = 0_1_10000002110)]"]; subgraph cluster35 { isCluster="true"; id="cluster35"; label="WholeStageCodegen (1)\n \nduration: 0 ms"; tooltip="WholeStageCodegen (1)"; 36 [id="node36" labelType="html" label="Filter number of output rows: 0" tooltip="Filter (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))"]; 37 [id="node37" labelType="html" label="Scan ExistingRDD number of output rows: 0" tooltip="Scan ExistingRDD[shardId#981205,orderProposalId#981206L,items#981207,optimizationGroups#981208,isOptimal#981209,lastModified#981210,optimizationInsights#981211]"]; } 39 [id="node39" labelType="html" label="Exchange shuffle records written: 8 remote merged reqs duration: 0 ms remote merged blocks fetched: 0 records read: 8 local bytes read total (min, med, max (stageId: taskId)) 672.0 B (84.0 B, 84.0 B, 168.0 B (stage 82860.0: task 200062)) merged fetch fallback count: 0 local blocks read: 8 remote merged chunks fetched: 0 remote blocks read: 0 data size total (min, med, max (stageId: taskId)) 192.0 B (24.0 B, 24.0 B, 48.0 B (stage 82859.0: task 200056)) local merged bytes read: 0.0 B local merged chunks fetched: 0 shuffle write time total (min, med, max (stageId: taskId)) 2 ms (0 ms, 0 ms, 0 ms (stage 82859.0: task 200056)) remote merged bytes read: 0.0 B local merged blocks fetched: 0 corrupt merged block chunks: 0 fetch wait time total (min, med, max (stageId: taskId)) 0 ms (0 ms, 0 ms, 0 ms (stage 82860.0: task 200061)) remote bytes read: 0.0 B number of partitions: 20 remote reqs duration: 0 ms remote bytes read to disk: 0.0 B shuffle bytes written total (min, med, max (stageId: taskId)) 672.0 B (84.0 B, 84.0 B, 168.0 B (stage 82859.0: task 200056))" tooltip="Exchange hashpartitioning(worklistShardItemId#981941L, 20), REPARTITION_BY_NUM, [plan_id=382529]"]; subgraph cluster40 { isCluster="true"; id="cluster40"; label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n696 ms (108 ms, 115 ms, 132 ms (stage 82859.0: task 200055))"; tooltip="WholeStageCodegen (3)"; 41 [id="node41" labelType="html" label=" Project " tooltip="Project [orderProposalId#981918L, worklistShardItemId#981941L]"]; 42 [id="node42" labelType="html" label="Filter number of output rows: 8" tooltip="Filter ((isnotnull(worklistShardItemId#981941L) AND NOT (isFallbackOrderOnly#981935 <=> true)) AND isnotnull(orderProposalId#981918L))"]; 43 [id="node43" labelType="html" label="ColumnarToRow number of output rows: 8 number of input batches: 6" tooltip="ColumnarToRow"]; } 44 [id="node44" labelType="html" label="Scan parquet number of files read: 6 scan time total (min, med, max (stageId: taskId)) 669 ms (105 ms, 109 ms, 126 ms (stage 82859.0: task 200055)) dynamic partition pruning time: 0 ms metadata time: 0 ms size of files read: 113.9 KiB number of output rows: 8 number of partitions read: 1" tooltip="FileScan parquet [orderProposalId#981918L,isFallbackOrderOnly#981935,worklistShardItemId#981941L,shardId#981962,sequenceId#981940] Batched: true, DataFilters: [isnotnull(worklistShardItemId#981941L), NOT (isFallbackOrderOnly#981935 <=> true), isnotnull(ord..., Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#981962), isnotnull(sequenceId#981940), (shardId#981962 = 0_1_10000002110), (se..., PushedFilters: [IsNotNull(worklistShardItemId), Not(EqualNullSafe(isFallbackOrderOnly,true)), IsNotNull(orderPro..., ReadSchema: struct<orderProposalId:bigint,isFallbackOrderOnly:boolean,worklistShardItemId:bigint>"]; 2->1; 4->2; 5->4; 6->5; 7->6; 8->7; 9->8; 11->9; 12->11; 14->12; 15->14; 17->15; 18->17; 19->8; 20->19; 22->20; 23->22; 24->23; 25->24; 27->25; 28->27; 29->28; 30->29; 31->30; 33->31; 34->33; 36->34; 37->36; 38->24; 39->38; 41->39; 42->41; 43->42; 44->43; }

Details

== Physical Plan ==
* HashAggregate (34)
+- Exchange (33)
   +- * HashAggregate (32)
      +- * Project (31)
         +- * Generate (30)
            +- * Project (29)
               +- * BroadcastHashJoin Inner BuildLeft (28)
                  :- BroadcastExchange (9)
                  :  +- * Filter (8)
                  :     +- InMemoryTableScan (1)
                  :           +- InMemoryRelation (2)
                  :                 +- * Filter (7)
                  :                    +- InMemoryTableScan (3)
                  :                          +- InMemoryRelation (4)
                  :                                +- * Filter (6)
                  :                                   +- * Scan ExistingRDD (5)
                  +- * HashAggregate (27)
                     +- Exchange (26)
                        +- * HashAggregate (25)
                           +- * Project (24)
                              +- * BroadcastHashJoin Inner BuildLeft (23)
                                 :- BroadcastExchange (16)
                                 :  +- * Project (15)
                                 :     +- * Generate (14)
                                 :        +- * Project (13)
                                 :           +- * Filter (12)
                                 :              +- InMemoryTableScan (10)
                                 :                    +- InMemoryRelation (11)
                                 :                          +- * Filter (7)
                                 :                             +- InMemoryTableScan (3)
                                 :                                   +- InMemoryRelation (4)
                                 :                                         +- * Filter (6)
                                 :                                            +- * Scan ExistingRDD (5)
                                 +- * Project (22)
                                    +- Exchange (21)
                                       +- * Project (20)
                                          +- * Filter (19)
                                             +- * ColumnarToRow (18)
                                                +- Scan parquet  (17)


(1) InMemoryTableScan
Output [3]: [shardId#981205, orderProposalId#981206L, optimizationInsights#981211]
Arguments: [shardId#981205, orderProposalId#981206L, optimizationInsights#981211], [isnotnull(orderProposalId#981206L), (size(optimizationInsights#981211, true) > 0), isnotnull(optimizationInsights#981211)]

(2) InMemoryRelation
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211], StorageLevel(disk, memory, 2 replicas)

(3) InMemoryTableScan
Output [6]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211]
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211], [isnotnull(shardId#981205), (shardId#981205 = 0_1_10000002110)]

(4) InMemoryRelation
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211], StorageLevel(disk, memory, 2 replicas)

(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211]
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211], MapPartitionsRDD[46018] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)

(6) Filter [codegen id : 1]
Input [7]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211]
Condition : (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))

(7) Filter [codegen id : 1]
Input [6]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211]
Condition : (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))

(8) Filter [codegen id : 1]
Input [3]: [shardId#981205, orderProposalId#981206L, optimizationInsights#981211]
Condition : ((isnotnull(orderProposalId#981206L) AND (size(optimizationInsights#981211, true) > 0)) AND isnotnull(optimizationInsights#981211))

(9) BroadcastExchange
Input [3]: [shardId#981205, orderProposalId#981206L, optimizationInsights#981211]
Arguments: HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=382514]

(10) InMemoryTableScan
Output [2]: [items#985333, shardId#985331]
Arguments: [items#985333, shardId#985331], [(size(items#985333.worklistShardItemId, true) > 0), isnotnull(items#985333.worklistShardItemId), (shardId#985331 = 0_1_10000002110)]

(11) InMemoryRelation
Arguments: [shardId#985331, orderProposalId#985332L, items#985333, optimizationGroups#985334, isOptimal#985335, optimizationInsights#985337], StorageLevel(disk, memory, 2 replicas)

(12) Filter [codegen id : 2]
Input [2]: [items#985333, shardId#985331]
Condition : (((size(items#985333.worklistShardItemId, true) > 0) AND isnotnull(items#985333.worklistShardItemId)) AND (shardId#985331 = 0_1_10000002110))

(13) Project [codegen id : 2]
Output [1]: [items#985333.worklistShardItemId AS _extract_worklistShardItemId#985470]
Input [2]: [items#985333, shardId#985331]

(14) Generate [codegen id : 2]
Input [1]: [_extract_worklistShardItemId#985470]
Arguments: explode(_extract_worklistShardItemId#985470), false, [item#981716L]

(15) Project [codegen id : 2]
Output [1]: [item#981716L AS worklistShardItemId#981717L]
Input [1]: [item#981716L]

(16) BroadcastExchange
Input [1]: [worklistShardItemId#981717L]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=382522]

(17) Scan parquet 
Output [5]: [orderProposalId#981918L, isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]
Batched: true
Location: PreparedDeltaFileIndex [hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20.hanacloud.ondemand.com:443/crp-order-qty-opt-service/internal/prod-plant-snapshot/10000002110]
PartitionFilters: [isnotnull(shardId#981962), isnotnull(sequenceId#981940), (shardId#981962 = 0_1_10000002110), (sequenceId#981940 = 2)]
PushedFilters: [IsNotNull(worklistShardItemId), Not(EqualNullSafe(isFallbackOrderOnly,true)), IsNotNull(orderProposalId)]
ReadSchema: struct<orderProposalId:bigint,isFallbackOrderOnly:boolean,worklistShardItemId:bigint>

(18) ColumnarToRow [codegen id : 3]
Input [5]: [orderProposalId#981918L, isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]

(19) Filter [codegen id : 3]
Input [5]: [orderProposalId#981918L, isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]
Condition : ((isnotnull(worklistShardItemId#981941L) AND NOT (isFallbackOrderOnly#981935 <=> true)) AND isnotnull(orderProposalId#981918L))

(20) Project [codegen id : 3]
Output [2]: [orderProposalId#981918L, worklistShardItemId#981941L]
Input [5]: [orderProposalId#981918L, isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]

(21) Exchange
Input [2]: [orderProposalId#981918L, worklistShardItemId#981941L]
Arguments: hashpartitioning(worklistShardItemId#981941L, 20), REPARTITION_BY_NUM, [plan_id=382529]

(22) Project
Output [2]: [worklistShardItemId#981941L, orderProposalId#981918L]
Input [2]: [orderProposalId#981918L, worklistShardItemId#981941L]

(23) BroadcastHashJoin [codegen id : 4]
Left keys [1]: [worklistShardItemId#981717L]
Right keys [1]: [worklistShardItemId#981941L]
Join type: Inner
Join condition: None

(24) Project [codegen id : 4]
Output [1]: [orderProposalId#981918L]
Input [3]: [worklistShardItemId#981717L, worklistShardItemId#981941L, orderProposalId#981918L]

(25) HashAggregate [codegen id : 4]
Input [1]: [orderProposalId#981918L]
Keys [1]: [orderProposalId#981918L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#981918L]

(26) Exchange
Input [1]: [orderProposalId#981918L]
Arguments: hashpartitioning(orderProposalId#981918L, 20), ENSURE_REQUIREMENTS, [plan_id=382536]

(27) HashAggregate
Input [1]: [orderProposalId#981918L]
Keys [1]: [orderProposalId#981918L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#981918L]

(28) BroadcastHashJoin [codegen id : 5]
Left keys [1]: [orderProposalId#981206L]
Right keys [1]: [orderProposalId#981918L]
Join type: Inner
Join condition: None

(29) Project [codegen id : 5]
Output [2]: [shardId#981205, optimizationInsights#981211]
Input [4]: [shardId#981205, orderProposalId#981206L, optimizationInsights#981211, orderProposalId#981918L]

(30) Generate [codegen id : 5]
Input [2]: [shardId#981205, optimizationInsights#981211]
Arguments: explode(optimizationInsights#981211), [shardId#981205], false, [insight#985339]

(31) Project [codegen id : 5]
Output [1]: [shardId#981205]
Input [2]: [shardId#981205, insight#985339]

(32) HashAggregate [codegen id : 5]
Input [1]: [shardId#981205]
Keys [1]: [shardId#981205]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#981205]

(33) Exchange
Input [1]: [shardId#981205]
Arguments: hashpartitioning(shardId#981205, 20), ENSURE_REQUIREMENTS, [plan_id=382545]

(34) HashAggregate [codegen id : 6]
Input [1]: [shardId#981205]
Keys [1]: [shardId#981205]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#981205]

SQL / DataFrame Properties

Name	Value
spark.activity.hdlfsEnabled	true
spark.activity.isolateSession	true
spark.databricks.delta.lastCommitVersionInSession	3
spark.sql.adaptive.enabled	false
spark.sql.cbo.enabled	false
spark.sql.parquet.fieldId.read.enabled	true
spark.sql.parquet.fieldId.write.enabled	true
spark.sql.requireAllClusterKeysForDistribution	false
spark.sql.shuffle.partitions	20
temporal.activity.id	e7ffe1a0-0467-3c22-aee2-5916f98db50c
temporal.activity.type	RunStreamWithId