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

Submitted Time: 2026/08/10 11:31:39
Duration: 1.0 s
Succeeded Jobs: 5548 5549 5550

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))\n60 ms (0 ms, 6 ms, 6 ms (stage 69167.0: task 175164))"; 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)) 6 ms (0 ms, 0 ms, 2 ms (stage 69167.0: task 175162)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 69167.0: task 175164)) number of output rows: 0 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#847553], 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#847553, 20), ENSURE_REQUIREMENTS, [plan_id=336766]"]; subgraph cluster3 { isCluster="true"; id="cluster3"; label="WholeStageCodegen (5)\n \nduration: total (min, med, max (stageId: taskId))\n371 ms (0 ms, 13 ms, 61 ms (stage 69166.0: task 175149))"; 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)) 37 ms (0 ms, 3 ms, 4 ms (stage 69166.0: task 175140)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 69166.0: task 175145)) number of output rows: 0 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#847553], functions=[])"]; 5 [id="node5" labelType="html" label=" Project " tooltip="Project [shardId#847553]"]; 6 [id="node6" labelType="html" label="Generate number of output rows: 0" tooltip="Generate explode(optimizationInsights#847559), [shardId#847553], false, [insight#851864]"]; 7 [id="node7" labelType="html" label=" Project " tooltip="Project [shardId#847553, optimizationInsights#847559]"]; 8 [id="node8" labelType="html" label="BroadcastHashJoin number of output rows: 0" tooltip="BroadcastHashJoin [orderProposalId#847554L], [orderProposalId#848266L], 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 69166.0: task 175141)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 69166.0: task 175145)) number of output rows: 4 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#848266L], functions=[])"]; } 9 [id="node9" labelType="html" label="BroadcastExchange time to broadcast: 0 ms time to build: 0 ms time to collect: 98 ms number of output rows: 0 data size: 0.0 B" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=336735]"]; 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 69163.0: task 175090))"; tooltip="WholeStageCodegen (1)"; 11 [id="node11" labelType="html" label="Filter number of output rows: 0" tooltip="Filter ((isnotnull(orderProposalId#847554L) AND (size(optimizationInsights#847559, true) > 0)) AND isnotnull(optimizationInsights#847559))"]; } 12 [id="node12" labelType="html" label="InMemoryTableScan number of output rows: 4" tooltip="InMemoryTableScan [shardId#847553, orderProposalId#847554L, optimizationInsights#847559], [isnotnull(orderProposalId#847554L), (size(optimizationInsights#847559, true) > 0), isnotnull(optimizationInsights#847559)]"]; 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#847553) AND (shardId#847553 = 0_1_10000002109))"]; } 15 [id="node15" labelType="html" label="InMemoryTableScan number of output rows: 0" tooltip="InMemoryTableScan [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, optimizationInsights#847559], [isnotnull(shardId#847553), (shardId#847553 = 0_1_10000002109)]"]; 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#847553) AND (shardId#847553 = 0_1_10000002109))"]; 18 [id="node18" labelType="html" label="Scan ExistingRDD number of output rows: 0" tooltip="Scan ExistingRDD[shardId#847553,orderProposalId#847554L,items#847555,optimizationGroups#847556,isOptimal#847557,lastModified#847558,optimizationInsights#847559]"]; } 20 [id="node20" labelType="html" label="Exchange shuffle records written: 6 remote merged reqs duration: 0 ms remote merged blocks fetched: 0 records read: 6 local bytes read total (min, med, max (stageId: taskId)) 375.0 B (75.0 B, 150.0 B, 150.0 B (stage 69166.0: task 175140)) merged fetch fallback count: 0 local blocks read: 5 remote merged chunks fetched: 0 remote blocks read: 1 data size total (min, med, max (stageId: taskId)) 96.0 B (16.0 B, 16.0 B, 32.0 B (stage 69165.0: task 175121)) 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 69165.0: task 175121)) 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 69166.0: task 175140)) remote bytes read: 75.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)) 450.0 B (75.0 B, 75.0 B, 150.0 B (stage 69165.0: task 175121))" tooltip="Exchange hashpartitioning(orderProposalId#848266L, 20), ENSURE_REQUIREMENTS, [plan_id=336757]"]; subgraph cluster21 { isCluster="true"; id="cluster21"; label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n103 ms (0 ms, 10 ms, 11 ms (stage 69165.0: task 175123))"; 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)) 5 ms (0 ms, 0 ms, 1 ms (stage 69165.0: task 175129)) peak memory total (min, med, max (stageId: taskId)) 5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 69165.0: task 175125)) number of output rows: 6 number of sort fallback tasks: 0 avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#848266L], functions=[])"]; 23 [id="node23" labelType="html" label=" Project " tooltip="Project [orderProposalId#848266L]"]; 24 [id="node24" labelType="html" label="BroadcastHashJoin number of output rows: 6" tooltip="BroadcastHashJoin [worklistShardItemId#848065L], [worklistShardItemId#848289L], Inner, BuildLeft, false"]; 38 [id="node38" labelType="html" label=" Project " tooltip="Project [worklistShardItemId#848289L, orderProposalId#848266L]"]; } 25 [id="node25" labelType="html" label="BroadcastExchange time to broadcast: 0 ms time to build: 0 ms time to collect: 59 ms number of output rows: 6 data size: 1024.1 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=336743]"]; 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 69162.0: task 175083))"; tooltip="WholeStageCodegen (2)"; 27 [id="node27" labelType="html" label=" Project " tooltip="Project [item#848064L AS worklistShardItemId#848065L]"]; 28 [id="node28" labelType="html" label="Generate number of output rows: 6" tooltip="Generate explode(_extract_worklistShardItemId#851995), false, [item#848064L]"]; 29 [id="node29" labelType="html" label=" Project " tooltip="Project [items#851858.worklistShardItemId AS _extract_worklistShardItemId#851995]"]; 30 [id="node30" labelType="html" label="Filter number of output rows: 4" tooltip="Filter (((size(items#851858.worklistShardItemId, true) > 0) AND isnotnull(items#851858.worklistShardItemId)) AND (shardId#851856 = 0_1_10000002109))"]; } 31 [id="node31" labelType="html" label="InMemoryTableScan number of output rows: 4" tooltip="InMemoryTableScan [items#851858, shardId#851856], [(size(items#851858.worklistShardItemId, true) > 0), isnotnull(items#851858.worklistShardItemId), (shardId#851856 = 0_1_10000002109)]"]; 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#847553) AND (shardId#847553 = 0_1_10000002109))"]; } 34 [id="node34" labelType="html" label="InMemoryTableScan number of output rows: 0" tooltip="InMemoryTableScan [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, optimizationInsights#847559], [isnotnull(shardId#847553), (shardId#847553 = 0_1_10000002109)]"]; 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#847553) AND (shardId#847553 = 0_1_10000002109))"]; 37 [id="node37" labelType="html" label="Scan ExistingRDD number of output rows: 0" tooltip="Scan ExistingRDD[shardId#847553,orderProposalId#847554L,items#847555,optimizationGroups#847556,isOptimal#847557,lastModified#847558,optimizationInsights#847559]"]; } 39 [id="node39" labelType="html" label="Exchange shuffle records written: 6 remote merged reqs duration: 0 ms remote merged blocks fetched: 0 records read: 6 local bytes read total (min, med, max (stageId: taskId)) 420.0 B (84.0 B, 84.0 B, 84.0 B (stage 69165.0: task 175120)) merged fetch fallback count: 0 local blocks read: 5 remote merged chunks fetched: 0 remote blocks read: 1 data size total (min, med, max (stageId: taskId)) 144.0 B (24.0 B, 48.0 B, 48.0 B (stage 69164.0: task 175116)) local merged bytes read: 0.0 B local merged chunks fetched: 0 shuffle write time total (min, med, max (stageId: taskId)) 1 ms (0 ms, 0 ms, 0 ms (stage 69164.0: task 175116)) 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 69165.0: task 175120)) remote bytes read: 84.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)) 504.0 B (84.0 B, 168.0 B, 168.0 B (stage 69164.0: task 175116))" tooltip="Exchange hashpartitioning(worklistShardItemId#848289L, 20), REPARTITION_BY_NUM, [plan_id=336750]"]; subgraph cluster40 { isCluster="true"; id="cluster40"; label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n466 ms (104 ms, 122 ms, 123 ms (stage 69164.0: task 175117))"; tooltip="WholeStageCodegen (3)"; 41 [id="node41" labelType="html" label=" Project " tooltip="Project [orderProposalId#848266L, worklistShardItemId#848289L]"]; 42 [id="node42" labelType="html" label="Filter number of output rows: 6" tooltip="Filter ((isnotnull(worklistShardItemId#848289L) AND NOT (isFallbackOrderOnly#848283 <=> true)) AND isnotnull(orderProposalId#848266L))"]; 43 [id="node43" labelType="html" label="ColumnarToRow number of output rows: 6 number of input batches: 4" tooltip="ColumnarToRow"]; } 44 [id="node44" labelType="html" label="Scan parquet number of files read: 4 scan time total (min, med, max (stageId: taskId)) 454 ms (101 ms, 119 ms, 120 ms (stage 69164.0: task 175117)) dynamic partition pruning time: 0 ms metadata time: 0 ms size of files read: 76.8 KiB number of output rows: 6 number of partitions read: 1" tooltip="FileScan parquet [orderProposalId#848266L,isFallbackOrderOnly#848283,worklistShardItemId#848289L,shardId#848310,sequenceId#848288] Batched: true, DataFilters: [isnotnull(worklistShardItemId#848289L), NOT (isFallbackOrderOnly#848283 <=> true), isnotnull(ord..., Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#848310), isnotnull(sequenceId#848288), (shardId#848310 = 0_1_10000002109), (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#847553, orderProposalId#847554L, optimizationInsights#847559]
Arguments: [shardId#847553, orderProposalId#847554L, optimizationInsights#847559], [isnotnull(orderProposalId#847554L), (size(optimizationInsights#847559, true) > 0), isnotnull(optimizationInsights#847559)]

(2) InMemoryRelation
Arguments: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, optimizationInsights#847559], StorageLevel(disk, memory, 2 replicas)

(3) InMemoryTableScan
Output [6]: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, optimizationInsights#847559]
Arguments: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, optimizationInsights#847559], [isnotnull(shardId#847553), (shardId#847553 = 0_1_10000002109)]

(4) InMemoryRelation
Arguments: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, lastModified#847558, optimizationInsights#847559], StorageLevel(disk, memory, 2 replicas)

(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, lastModified#847558, optimizationInsights#847559]
Arguments: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, lastModified#847558, optimizationInsights#847559], MapPartitionsRDD[39846] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)

(6) Filter [codegen id : 1]
Input [7]: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, lastModified#847558, optimizationInsights#847559]
Condition : (isnotnull(shardId#847553) AND (shardId#847553 = 0_1_10000002109))

(7) Filter [codegen id : 1]
Input [6]: [shardId#847553, orderProposalId#847554L, items#847555, optimizationGroups#847556, isOptimal#847557, optimizationInsights#847559]
Condition : (isnotnull(shardId#847553) AND (shardId#847553 = 0_1_10000002109))

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

(9) BroadcastExchange
Input [3]: [shardId#847553, orderProposalId#847554L, optimizationInsights#847559]
Arguments: HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=336735]

(10) InMemoryTableScan
Output [2]: [items#851858, shardId#851856]
Arguments: [items#851858, shardId#851856], [(size(items#851858.worklistShardItemId, true) > 0), isnotnull(items#851858.worklistShardItemId), (shardId#851856 = 0_1_10000002109)]

(11) InMemoryRelation
Arguments: [shardId#851856, orderProposalId#851857L, items#851858, optimizationGroups#851859, isOptimal#851860, optimizationInsights#851862], StorageLevel(disk, memory, 2 replicas)

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

(13) Project [codegen id : 2]
Output [1]: [items#851858.worklistShardItemId AS _extract_worklistShardItemId#851995]
Input [2]: [items#851858, shardId#851856]

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

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

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

(17) Scan parquet 
Output [5]: [orderProposalId#848266L, isFallbackOrderOnly#848283, worklistShardItemId#848289L, shardId#848310, sequenceId#848288]
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/10000002109]
PartitionFilters: [isnotnull(shardId#848310), isnotnull(sequenceId#848288), (shardId#848310 = 0_1_10000002109), (sequenceId#848288 = 0)]
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#848266L, isFallbackOrderOnly#848283, worklistShardItemId#848289L, shardId#848310, sequenceId#848288]

(19) Filter [codegen id : 3]
Input [5]: [orderProposalId#848266L, isFallbackOrderOnly#848283, worklistShardItemId#848289L, shardId#848310, sequenceId#848288]
Condition : ((isnotnull(worklistShardItemId#848289L) AND NOT (isFallbackOrderOnly#848283 <=> true)) AND isnotnull(orderProposalId#848266L))

(20) Project [codegen id : 3]
Output [2]: [orderProposalId#848266L, worklistShardItemId#848289L]
Input [5]: [orderProposalId#848266L, isFallbackOrderOnly#848283, worklistShardItemId#848289L, shardId#848310, sequenceId#848288]

(21) Exchange
Input [2]: [orderProposalId#848266L, worklistShardItemId#848289L]
Arguments: hashpartitioning(worklistShardItemId#848289L, 20), REPARTITION_BY_NUM, [plan_id=336750]

(22) Project
Output [2]: [worklistShardItemId#848289L, orderProposalId#848266L]
Input [2]: [orderProposalId#848266L, worklistShardItemId#848289L]

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

(24) Project [codegen id : 4]
Output [1]: [orderProposalId#848266L]
Input [3]: [worklistShardItemId#848065L, worklistShardItemId#848289L, orderProposalId#848266L]

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

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

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

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

(29) Project [codegen id : 5]
Output [2]: [shardId#847553, optimizationInsights#847559]
Input [4]: [shardId#847553, orderProposalId#847554L, optimizationInsights#847559, orderProposalId#848266L]

(30) Generate [codegen id : 5]
Input [2]: [shardId#847553, optimizationInsights#847559]
Arguments: explode(optimizationInsights#847559), [shardId#847553], false, [insight#851864]

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

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

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

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

SQL / DataFrame Properties

Name	Value
spark.activity.hdlfsEnabled	true
spark.activity.isolateSession	true
spark.databricks.delta.lastCommitVersionInSession	1
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	131fcd6d-c8ad-319b-b0d3-c5c4424561c9
temporal.activity.type	RunStreamWithId