digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (6)\n \nduration: total (min, med, max (stageId: taskId))\n110 ms (0 ms, 4 ms, 14 ms (stage 1311866.0: task 2446385))";
tooltip="WholeStageCodegen (6)";
1 [id="node1" labelType="html" label="<b>HashAggregate</b><br><br>spill size: 0.0 B<br>time in aggregation build total (min, med, max (stageId: taskId))<br>8 ms (0 ms, 0 ms, 1 ms (stage 1311866.0: task 2446380))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1311866.0: task 2446380))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#5499000], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 0<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 0<br>local bytes read: 0.0 B<br>merged fetch fallback count: 0<br>local blocks read: 0<br>remote merged chunks fetched: 0<br>remote blocks read: 0<br>data size: 0.0 B<br>local merged bytes read: 0.0 B<br>local merged chunks fetched: 0<br>shuffle write time: 0 ms<br>remote merged bytes read: 0.0 B<br>local merged blocks fetched: 0<br>corrupt merged block chunks: 0<br>fetch wait time: 0 ms<br>remote bytes read: 0.0 B<br>number of partitions: 30<br>remote reqs duration: 0 ms<br>remote bytes read to disk: 0.0 B<br>shuffle bytes written: 0.0 B" tooltip="Exchange hashpartitioning(shardId#5499000, 30), ENSURE_REQUIREMENTS, [plan_id=2854445]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (5)\n \nduration: total (min, med, max (stageId: taskId))\n240 ms (0 ms, 8 ms, 28 ms (stage 1311865.0: task 2446361))";
tooltip="WholeStageCodegen (5)";
4 [id="node4" labelType="html" label="<b>HashAggregate</b><br><br>spill size: 0.0 B<br>time in aggregation build total (min, med, max (stageId: taskId))<br>71 ms (0 ms, 2 ms, 10 ms (stage 1311865.0: task 2446361))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1311865.0: task 2446356))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#5499000], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#5499000]"];
6 [id="node6" labelType="html" label="<b>Generate</b><br><br>number of output rows: 0" tooltip="Generate explode(optimizationInsights#5499006), [shardId#5499000], false, [insight#5503292]"];
7 [id="node7" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#5499000, optimizationInsights#5499006]"];
8 [id="node8" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [orderProposalId#5499001L], [orderProposalId#5499713L], Inner, BuildLeft, false"];
19 [id="node19" labelType="html" label="<b>HashAggregate</b><br><br>spill size: 0.0 B<br>time in aggregation build total (min, med, max (stageId: taskId))<br>15 ms (0 ms, 0 ms, 4 ms (stage 1311865.0: task 2446349))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1311865.0: task 2446356))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#5499713L], functions=[])"];
}
9 [id="node9" labelType="html" label="<b>BroadcastExchange</b><br><br>time to broadcast: 0 ms<br>time to build: 0 ms<br>time to collect: 122 ms<br>number of output rows: 0<br>data size: 0.0 B" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=2854414]"];
subgraph cluster10 {
isCluster="true";
id="cluster10";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n5 ms (0 ms, 0 ms, 1 ms (stage 1311861.0: task 2446248))";
tooltip="WholeStageCodegen (1)";
11 [id="node11" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter ((isnotnull(orderProposalId#5499001L) AND (size(optimizationInsights#5499006, true) > 0)) AND isnotnull(optimizationInsights#5499006))"];
}
12 [id="node12" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 2" tooltip="InMemoryTableScan [shardId#5499000, orderProposalId#5499001L, optimizationInsights#5499006], [isnotnull(orderProposalId#5499001L), (size(optimizationInsights#5499006, true) > 0), isnotnull(optimizationInsights#5499006)]"];
subgraph cluster13 {
isCluster="true";
id="cluster13";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
14 [id="node14" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))"];
}
15 [id="node15" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006], [isnotnull(shardId#5499000), (shardId#5499000 = 0_1_10000001445)]"];
subgraph cluster16 {
isCluster="true";
id="cluster16";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
17 [id="node17" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))"];
18 [id="node18" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#5499000,orderProposalId#5499001L,items#5499002,optimizationGroups#5499003,isOptimal#5499004,lastModified#5499005,optimizationInsights#5499006]"];
}
20 [id="node20" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 0<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 0<br>local bytes read: 0.0 B<br>merged fetch fallback count: 0<br>local blocks read: 0<br>remote merged chunks fetched: 0<br>remote blocks read: 0<br>data size: 0.0 B<br>local merged bytes read: 0.0 B<br>local merged chunks fetched: 0<br>shuffle write time: 0 ms<br>remote merged bytes read: 0.0 B<br>local merged blocks fetched: 0<br>corrupt merged block chunks: 0<br>fetch wait time: 0 ms<br>remote bytes read: 0.0 B<br>number of partitions: 30<br>remote reqs duration: 0 ms<br>remote bytes read to disk: 0.0 B<br>shuffle bytes written: 0.0 B" tooltip="Exchange hashpartitioning(orderProposalId#5499713L, 30), ENSURE_REQUIREMENTS, [plan_id=2854436]"];
subgraph cluster21 {
isCluster="true";
id="cluster21";
label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n191 ms (0 ms, 6 ms, 25 ms (stage 1311864.0: task 2446326))";
tooltip="WholeStageCodegen (4)";
22 [id="node22" labelType="html" label="<b>HashAggregate</b><br><br>spill size: 0.0 B<br>time in aggregation build total (min, med, max (stageId: taskId))<br>8 ms (0 ms, 0 ms, 3 ms (stage 1311864.0: task 2446320))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1311864.0: task 2446324))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#5499713L], functions=[])"];
23 [id="node23" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#5499713L]"];
24 [id="node24" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [worklistShardItemId#5499512L], [worklistShardItemId#5499736L], Inner, BuildLeft, false"];
38 [id="node38" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [worklistShardItemId#5499736L, orderProposalId#5499713L]"];
}
25 [id="node25" labelType="html" label="<b>BroadcastExchange</b><br><br>time to broadcast: 0 ms<br>time to build: 0 ms<br>time to collect: 82 ms<br>number of output rows: 29<br>data size: 1030.4 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=2854422]"];
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 1311862.0: task 2446255))";
tooltip="WholeStageCodegen (2)";
27 [id="node27" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [item#5499511L AS worklistShardItemId#5499512L]"];
28 [id="node28" labelType="html" label="<b>Generate</b><br><br>number of output rows: 29" tooltip="Generate explode(_extract_worklistShardItemId#5503423), false, [item#5499511L]"];
29 [id="node29" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [items#5503286.worklistShardItemId AS _extract_worklistShardItemId#5503423]"];
30 [id="node30" labelType="html" label="<b>Filter</b><br><br>number of output rows: 2" tooltip="Filter (((size(items#5503286.worklistShardItemId, true) > 0) AND isnotnull(items#5503286.worklistShardItemId)) AND (shardId#5503284 = 0_1_10000001445))"];
}
31 [id="node31" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 2" tooltip="InMemoryTableScan [items#5503286, shardId#5503284], [(size(items#5503286.worklistShardItemId, true) > 0), isnotnull(items#5503286.worklistShardItemId), (shardId#5503284 = 0_1_10000001445)]"];
subgraph cluster32 {
isCluster="true";
id="cluster32";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
33 [id="node33" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))"];
}
34 [id="node34" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006], [isnotnull(shardId#5499000), (shardId#5499000 = 0_1_10000001445)]"];
subgraph cluster35 {
isCluster="true";
id="cluster35";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
36 [id="node36" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))"];
37 [id="node37" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#5499000,orderProposalId#5499001L,items#5499002,optimizationGroups#5499003,isOptimal#5499004,lastModified#5499005,optimizationInsights#5499006]"];
}
39 [id="node39" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 0<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 0<br>local bytes read: 0.0 B<br>merged fetch fallback count: 0<br>local blocks read: 0<br>remote merged chunks fetched: 0<br>remote blocks read: 0<br>data size: 0.0 B<br>local merged bytes read: 0.0 B<br>local merged chunks fetched: 0<br>shuffle write time: 0 ms<br>remote merged bytes read: 0.0 B<br>local merged blocks fetched: 0<br>corrupt merged block chunks: 0<br>fetch wait time: 0 ms<br>remote bytes read: 0.0 B<br>number of partitions: 30<br>remote reqs duration: 0 ms<br>remote bytes read to disk: 0.0 B<br>shuffle bytes written: 0.0 B" tooltip="Exchange hashpartitioning(worklistShardItemId#5499736L, 30), REPARTITION_BY_NUM, [plan_id=2854429]"];
subgraph cluster40 {
isCluster="true";
id="cluster40";
label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n1.3 s (60 ms, 77 ms, 83 ms (stage 1311863.0: task 2446309))";
tooltip="WholeStageCodegen (3)";
41 [id="node41" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#5499713L, worklistShardItemId#5499736L]"];
42 [id="node42" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter ((isnotnull(worklistShardItemId#5499736L) AND NOT (isFallbackOrderOnly#5499730 <=> true)) AND isnotnull(orderProposalId#5499713L))"];
43 [id="node43" labelType="html" label="<b>ColumnarToRow</b><br><br>number of output rows: 0<br>number of input batches: 0" tooltip="ColumnarToRow"];
}
44 [id="node44" labelType="html" label="<b>Scan parquet </b><br><br>number of files read: 17<br>scan time total (min, med, max (stageId: taskId))<br>1.2 s (60 ms, 74 ms, 81 ms (stage 1311863.0: task 2446309))<br>dynamic partition pruning time: 0 ms<br>metadata time: 0 ms<br>size of files read: 319.0 KiB<br>number of output rows: 0<br>number of partitions read: 1" tooltip="FileScan parquet [orderProposalId#5499713L,isFallbackOrderOnly#5499730,worklistShardItemId#5499736L,shardId#5499757,sequenceId#5499735] Batched: true, DataFilters: [isnotnull(worklistShardItemId#5499736L), NOT (isFallbackOrderOnly#5499730 <=> true), isnotnull(o..., Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://332d7051-0d16-44f5-ae76-bf2dcf30365f.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#5499757), isnotnull(sequenceId#5499735), (shardId#5499757 = 0_1_10000001445), ..., 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;
}
== 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#5499000, orderProposalId#5499001L, optimizationInsights#5499006]
Arguments: [shardId#5499000, orderProposalId#5499001L, optimizationInsights#5499006], [isnotnull(orderProposalId#5499001L), (size(optimizationInsights#5499006, true) > 0), isnotnull(optimizationInsights#5499006)]
(2) InMemoryRelation
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006]
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006], [isnotnull(shardId#5499000), (shardId#5499000 = 0_1_10000001445)]
(4) InMemoryRelation
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006]
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006], MapPartitionsRDD[387429] at start at FileStorageAdapterImpl.java:598, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006]
Condition : (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))
(7) Filter [codegen id : 1]
Input [6]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006]
Condition : (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))
(8) Filter [codegen id : 1]
Input [3]: [shardId#5499000, orderProposalId#5499001L, optimizationInsights#5499006]
Condition : ((isnotnull(orderProposalId#5499001L) AND (size(optimizationInsights#5499006, true) > 0)) AND isnotnull(optimizationInsights#5499006))
(9) BroadcastExchange
Input [3]: [shardId#5499000, orderProposalId#5499001L, optimizationInsights#5499006]
Arguments: HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=2854414]
(10) InMemoryTableScan
Output [2]: [items#5503286, shardId#5503284]
Arguments: [items#5503286, shardId#5503284], [(size(items#5503286.worklistShardItemId, true) > 0), isnotnull(items#5503286.worklistShardItemId), (shardId#5503284 = 0_1_10000001445)]
(11) InMemoryRelation
Arguments: [shardId#5503284, orderProposalId#5503285L, items#5503286, optimizationGroups#5503287, isOptimal#5503288, optimizationInsights#5503290], StorageLevel(disk, memory, 2 replicas)
(12) Filter [codegen id : 2]
Input [2]: [items#5503286, shardId#5503284]
Condition : (((size(items#5503286.worklistShardItemId, true) > 0) AND isnotnull(items#5503286.worklistShardItemId)) AND (shardId#5503284 = 0_1_10000001445))
(13) Project [codegen id : 2]
Output [1]: [items#5503286.worklistShardItemId AS _extract_worklistShardItemId#5503423]
Input [2]: [items#5503286, shardId#5503284]
(14) Generate [codegen id : 2]
Input [1]: [_extract_worklistShardItemId#5503423]
Arguments: explode(_extract_worklistShardItemId#5503423), false, [item#5499511L]
(15) Project [codegen id : 2]
Output [1]: [item#5499511L AS worklistShardItemId#5499512L]
Input [1]: [item#5499511L]
(16) BroadcastExchange
Input [1]: [worklistShardItemId#5499512L]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=2854422]
(17) Scan parquet
Output [5]: [orderProposalId#5499713L, isFallbackOrderOnly#5499730, worklistShardItemId#5499736L, shardId#5499757, sequenceId#5499735]
Batched: true
Location: PreparedDeltaFileIndex [hdlfs://332d7051-0d16-44f5-ae76-bf2dcf30365f.files.hdl.prod-eu20.hanacloud.ondemand.com:443/crp-order-qty-opt-service/internal/prod-plant-snapshot/10000001445]
PartitionFilters: [isnotnull(shardId#5499757), isnotnull(sequenceId#5499735), (shardId#5499757 = 0_1_10000001445), (sequenceId#5499735 = 6)]
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#5499713L, isFallbackOrderOnly#5499730, worklistShardItemId#5499736L, shardId#5499757, sequenceId#5499735]
(19) Filter [codegen id : 3]
Input [5]: [orderProposalId#5499713L, isFallbackOrderOnly#5499730, worklistShardItemId#5499736L, shardId#5499757, sequenceId#5499735]
Condition : ((isnotnull(worklistShardItemId#5499736L) AND NOT (isFallbackOrderOnly#5499730 <=> true)) AND isnotnull(orderProposalId#5499713L))
(20) Project [codegen id : 3]
Output [2]: [orderProposalId#5499713L, worklistShardItemId#5499736L]
Input [5]: [orderProposalId#5499713L, isFallbackOrderOnly#5499730, worklistShardItemId#5499736L, shardId#5499757, sequenceId#5499735]
(21) Exchange
Input [2]: [orderProposalId#5499713L, worklistShardItemId#5499736L]
Arguments: hashpartitioning(worklistShardItemId#5499736L, 30), REPARTITION_BY_NUM, [plan_id=2854429]
(22) Project
Output [2]: [worklistShardItemId#5499736L, orderProposalId#5499713L]
Input [2]: [orderProposalId#5499713L, worklistShardItemId#5499736L]
(23) BroadcastHashJoin [codegen id : 4]
Left keys [1]: [worklistShardItemId#5499512L]
Right keys [1]: [worklistShardItemId#5499736L]
Join type: Inner
Join condition: None
(24) Project [codegen id : 4]
Output [1]: [orderProposalId#5499713L]
Input [3]: [worklistShardItemId#5499512L, worklistShardItemId#5499736L, orderProposalId#5499713L]
(25) HashAggregate [codegen id : 4]
Input [1]: [orderProposalId#5499713L]
Keys [1]: [orderProposalId#5499713L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#5499713L]
(26) Exchange
Input [1]: [orderProposalId#5499713L]
Arguments: hashpartitioning(orderProposalId#5499713L, 30), ENSURE_REQUIREMENTS, [plan_id=2854436]
(27) HashAggregate
Input [1]: [orderProposalId#5499713L]
Keys [1]: [orderProposalId#5499713L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#5499713L]
(28) BroadcastHashJoin [codegen id : 5]
Left keys [1]: [orderProposalId#5499001L]
Right keys [1]: [orderProposalId#5499713L]
Join type: Inner
Join condition: None
(29) Project [codegen id : 5]
Output [2]: [shardId#5499000, optimizationInsights#5499006]
Input [4]: [shardId#5499000, orderProposalId#5499001L, optimizationInsights#5499006, orderProposalId#5499713L]
(30) Generate [codegen id : 5]
Input [2]: [shardId#5499000, optimizationInsights#5499006]
Arguments: explode(optimizationInsights#5499006), [shardId#5499000], false, [insight#5503292]
(31) Project [codegen id : 5]
Output [1]: [shardId#5499000]
Input [2]: [shardId#5499000, insight#5503292]
(32) HashAggregate [codegen id : 5]
Input [1]: [shardId#5499000]
Keys [1]: [shardId#5499000]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#5499000]
(33) Exchange
Input [1]: [shardId#5499000]
Arguments: hashpartitioning(shardId#5499000, 30), ENSURE_REQUIREMENTS, [plan_id=2854445]
(34) HashAggregate [codegen id : 6]
Input [1]: [shardId#5499000]
Keys [1]: [shardId#5499000]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#5499000]