digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (6)\n \nduration: total (min, med, max (stageId: taskId))\n105 ms (0 ms, 4 ms, 13 ms (stage 1576021.0: task 2945099))";
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>14 ms (0 ms, 0 ms, 4 ms (stage 1576021.0: task 2945099))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1576021.0: task 2945106))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#6608407], 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#6608407, 30), ENSURE_REQUIREMENTS, [plan_id=3474210]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (5)\n \nduration: total (min, med, max (stageId: taskId))\n539 ms (0 ms, 26 ms, 41 ms (stage 1576020.0: task 2945078))";
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>63 ms (0 ms, 2 ms, 8 ms (stage 1576020.0: task 2945077))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1576020.0: task 2945082))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#6608407], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#6608407]"];
6 [id="node6" labelType="html" label="<b>Generate</b><br><br>number of output rows: 0" tooltip="Generate explode(optimizationInsights#6608413), [shardId#6608407], false, [insight#6612539]"];
7 [id="node7" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#6608407, optimizationInsights#6608413]"];
8 [id="node8" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [orderProposalId#6608408L], [orderProposalId#6609120L], 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 1576020.0: task 2945074))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1576020.0: task 2945082))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#6609120L], 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: 236 ms<br>number of output rows: 0<br>data size: 0.0 B" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=3474179]"];
subgraph cluster10 {
isCluster="true";
id="cluster10";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n12 ms (0 ms, 0 ms, 4 ms (stage 1576016.0: task 2944951))";
tooltip="WholeStageCodegen (1)";
11 [id="node11" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter ((isnotnull(orderProposalId#6608408L) AND (size(optimizationInsights#6608413, true) > 0)) AND isnotnull(optimizationInsights#6608413))"];
}
12 [id="node12" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 22" tooltip="InMemoryTableScan [shardId#6608407, orderProposalId#6608408L, optimizationInsights#6608413], [isnotnull(orderProposalId#6608408L), (size(optimizationInsights#6608413, true) > 0), isnotnull(optimizationInsights#6608413)]"];
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#6608407) AND (shardId#6608407 = 0_1_10000002290))"];
}
15 [id="node15" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, optimizationInsights#6608413], [isnotnull(shardId#6608407), (shardId#6608407 = 0_1_10000002290)]"];
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#6608407) AND (shardId#6608407 = 0_1_10000002290))"];
18 [id="node18" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#6608407,orderProposalId#6608408L,items#6608409,optimizationGroups#6608410,isOptimal#6608411,lastModified#6608412,optimizationInsights#6608413]"];
}
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#6609120L, 30), ENSURE_REQUIREMENTS, [plan_id=3474201]"];
subgraph cluster21 {
isCluster="true";
id="cluster21";
label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n185 ms (0 ms, 6 ms, 23 ms (stage 1576019.0: task 2945047))";
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>14 ms (0 ms, 0 ms, 4 ms (stage 1576019.0: task 2945050))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1576019.0: task 2945051))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#6609120L], functions=[])"];
23 [id="node23" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#6609120L]"];
24 [id="node24" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [worklistShardItemId#6608919L], [worklistShardItemId#6609143L], Inner, BuildLeft, false"];
38 [id="node38" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [worklistShardItemId#6609143L, orderProposalId#6609120L]"];
}
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: 86 ms<br>number of output rows: 415<br>data size: 1036.9 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=3474187]"];
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 1576017.0: task 2944960))";
tooltip="WholeStageCodegen (2)";
27 [id="node27" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [item#6608918L AS worklistShardItemId#6608919L]"];
28 [id="node28" labelType="html" label="<b>Generate</b><br><br>number of output rows: 415" tooltip="Generate explode(_extract_worklistShardItemId#6612670), false, [item#6608918L]"];
29 [id="node29" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [items#6612533.worklistShardItemId AS _extract_worklistShardItemId#6612670]"];
30 [id="node30" labelType="html" label="<b>Filter</b><br><br>number of output rows: 22" tooltip="Filter (((size(items#6612533.worklistShardItemId, true) > 0) AND isnotnull(items#6612533.worklistShardItemId)) AND (shardId#6612531 = 0_1_10000002290))"];
}
31 [id="node31" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 22" tooltip="InMemoryTableScan [items#6612533, shardId#6612531], [(size(items#6612533.worklistShardItemId, true) > 0), isnotnull(items#6612533.worklistShardItemId), (shardId#6612531 = 0_1_10000002290)]"];
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#6608407) AND (shardId#6608407 = 0_1_10000002290))"];
}
34 [id="node34" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, optimizationInsights#6608413], [isnotnull(shardId#6608407), (shardId#6608407 = 0_1_10000002290)]"];
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#6608407) AND (shardId#6608407 = 0_1_10000002290))"];
37 [id="node37" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#6608407,orderProposalId#6608408L,items#6608409,optimizationGroups#6608410,isOptimal#6608411,lastModified#6608412,optimizationInsights#6608413]"];
}
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#6609143L, 30), REPARTITION_BY_NUM, [plan_id=3474194]"];
subgraph cluster40 {
isCluster="true";
id="cluster40";
label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n2.5 s (48 ms, 68 ms, 93 ms (stage 1576018.0: task 2945004))";
tooltip="WholeStageCodegen (3)";
41 [id="node41" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#6609120L, worklistShardItemId#6609143L]"];
42 [id="node42" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter ((isnotnull(worklistShardItemId#6609143L) AND NOT (isFallbackOrderOnly#6609137 <=> true)) AND isnotnull(orderProposalId#6609120L))"];
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: 37<br>scan time total (min, med, max (stageId: taskId))<br>2.5 s (47 ms, 68 ms, 88 ms (stage 1576018.0: task 2945004))<br>dynamic partition pruning time: 0 ms<br>metadata time: 0 ms<br>size of files read: 787.6 KiB<br>number of output rows: 0<br>number of partitions read: 1" tooltip="FileScan parquet [orderProposalId#6609120L,isFallbackOrderOnly#6609137,worklistShardItemId#6609143L,shardId#6609164,sequenceId#6609142] Batched: true, DataFilters: [isnotnull(worklistShardItemId#6609143L), NOT (isFallbackOrderOnly#6609137 <=> true), isnotnull(o..., Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://dac252a8-bd1b-4f30-995e-f6d4a08836d2.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#6609164), isnotnull(sequenceId#6609142), (shardId#6609164 = 0_1_10000002290), ..., 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#6608407, orderProposalId#6608408L, optimizationInsights#6608413]
Arguments: [shardId#6608407, orderProposalId#6608408L, optimizationInsights#6608413], [isnotnull(orderProposalId#6608408L), (size(optimizationInsights#6608413, true) > 0), isnotnull(optimizationInsights#6608413)]
(2) InMemoryRelation
Arguments: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, optimizationInsights#6608413], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, optimizationInsights#6608413]
Arguments: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, optimizationInsights#6608413], [isnotnull(shardId#6608407), (shardId#6608407 = 0_1_10000002290)]
(4) InMemoryRelation
Arguments: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, lastModified#6608412, optimizationInsights#6608413], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, lastModified#6608412, optimizationInsights#6608413]
Arguments: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, lastModified#6608412, optimizationInsights#6608413], MapPartitionsRDD[467832] at start at FileStorageAdapterImpl.java:598, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, lastModified#6608412, optimizationInsights#6608413]
Condition : (isnotnull(shardId#6608407) AND (shardId#6608407 = 0_1_10000002290))
(7) Filter [codegen id : 1]
Input [6]: [shardId#6608407, orderProposalId#6608408L, items#6608409, optimizationGroups#6608410, isOptimal#6608411, optimizationInsights#6608413]
Condition : (isnotnull(shardId#6608407) AND (shardId#6608407 = 0_1_10000002290))
(8) Filter [codegen id : 1]
Input [3]: [shardId#6608407, orderProposalId#6608408L, optimizationInsights#6608413]
Condition : ((isnotnull(orderProposalId#6608408L) AND (size(optimizationInsights#6608413, true) > 0)) AND isnotnull(optimizationInsights#6608413))
(9) BroadcastExchange
Input [3]: [shardId#6608407, orderProposalId#6608408L, optimizationInsights#6608413]
Arguments: HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=3474179]
(10) InMemoryTableScan
Output [2]: [items#6612533, shardId#6612531]
Arguments: [items#6612533, shardId#6612531], [(size(items#6612533.worklistShardItemId, true) > 0), isnotnull(items#6612533.worklistShardItemId), (shardId#6612531 = 0_1_10000002290)]
(11) InMemoryRelation
Arguments: [shardId#6612531, orderProposalId#6612532L, items#6612533, optimizationGroups#6612534, isOptimal#6612535, optimizationInsights#6612537], StorageLevel(disk, memory, 2 replicas)
(12) Filter [codegen id : 2]
Input [2]: [items#6612533, shardId#6612531]
Condition : (((size(items#6612533.worklistShardItemId, true) > 0) AND isnotnull(items#6612533.worklistShardItemId)) AND (shardId#6612531 = 0_1_10000002290))
(13) Project [codegen id : 2]
Output [1]: [items#6612533.worklistShardItemId AS _extract_worklistShardItemId#6612670]
Input [2]: [items#6612533, shardId#6612531]
(14) Generate [codegen id : 2]
Input [1]: [_extract_worklistShardItemId#6612670]
Arguments: explode(_extract_worklistShardItemId#6612670), false, [item#6608918L]
(15) Project [codegen id : 2]
Output [1]: [item#6608918L AS worklistShardItemId#6608919L]
Input [1]: [item#6608918L]
(16) BroadcastExchange
Input [1]: [worklistShardItemId#6608919L]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=3474187]
(17) Scan parquet
Output [5]: [orderProposalId#6609120L, isFallbackOrderOnly#6609137, worklistShardItemId#6609143L, shardId#6609164, sequenceId#6609142]
Batched: true
Location: PreparedDeltaFileIndex [hdlfs://dac252a8-bd1b-4f30-995e-f6d4a08836d2.files.hdl.prod-eu20.hanacloud.ondemand.com:443/crp-order-qty-opt-service/internal/prod-plant-snapshot/10000002290]
PartitionFilters: [isnotnull(shardId#6609164), isnotnull(sequenceId#6609142), (shardId#6609164 = 0_1_10000002290), (sequenceId#6609142 = 3)]
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#6609120L, isFallbackOrderOnly#6609137, worklistShardItemId#6609143L, shardId#6609164, sequenceId#6609142]
(19) Filter [codegen id : 3]
Input [5]: [orderProposalId#6609120L, isFallbackOrderOnly#6609137, worklistShardItemId#6609143L, shardId#6609164, sequenceId#6609142]
Condition : ((isnotnull(worklistShardItemId#6609143L) AND NOT (isFallbackOrderOnly#6609137 <=> true)) AND isnotnull(orderProposalId#6609120L))
(20) Project [codegen id : 3]
Output [2]: [orderProposalId#6609120L, worklistShardItemId#6609143L]
Input [5]: [orderProposalId#6609120L, isFallbackOrderOnly#6609137, worklistShardItemId#6609143L, shardId#6609164, sequenceId#6609142]
(21) Exchange
Input [2]: [orderProposalId#6609120L, worklistShardItemId#6609143L]
Arguments: hashpartitioning(worklistShardItemId#6609143L, 30), REPARTITION_BY_NUM, [plan_id=3474194]
(22) Project
Output [2]: [worklistShardItemId#6609143L, orderProposalId#6609120L]
Input [2]: [orderProposalId#6609120L, worklistShardItemId#6609143L]
(23) BroadcastHashJoin [codegen id : 4]
Left keys [1]: [worklistShardItemId#6608919L]
Right keys [1]: [worklistShardItemId#6609143L]
Join type: Inner
Join condition: None
(24) Project [codegen id : 4]
Output [1]: [orderProposalId#6609120L]
Input [3]: [worklistShardItemId#6608919L, worklistShardItemId#6609143L, orderProposalId#6609120L]
(25) HashAggregate [codegen id : 4]
Input [1]: [orderProposalId#6609120L]
Keys [1]: [orderProposalId#6609120L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#6609120L]
(26) Exchange
Input [1]: [orderProposalId#6609120L]
Arguments: hashpartitioning(orderProposalId#6609120L, 30), ENSURE_REQUIREMENTS, [plan_id=3474201]
(27) HashAggregate
Input [1]: [orderProposalId#6609120L]
Keys [1]: [orderProposalId#6609120L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#6609120L]
(28) BroadcastHashJoin [codegen id : 5]
Left keys [1]: [orderProposalId#6608408L]
Right keys [1]: [orderProposalId#6609120L]
Join type: Inner
Join condition: None
(29) Project [codegen id : 5]
Output [2]: [shardId#6608407, optimizationInsights#6608413]
Input [4]: [shardId#6608407, orderProposalId#6608408L, optimizationInsights#6608413, orderProposalId#6609120L]
(30) Generate [codegen id : 5]
Input [2]: [shardId#6608407, optimizationInsights#6608413]
Arguments: explode(optimizationInsights#6608413), [shardId#6608407], false, [insight#6612539]
(31) Project [codegen id : 5]
Output [1]: [shardId#6608407]
Input [2]: [shardId#6608407, insight#6612539]
(32) HashAggregate [codegen id : 5]
Input [1]: [shardId#6608407]
Keys [1]: [shardId#6608407]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#6608407]
(33) Exchange
Input [1]: [shardId#6608407]
Arguments: hashpartitioning(shardId#6608407, 30), ENSURE_REQUIREMENTS, [plan_id=3474210]
(34) HashAggregate [codegen id : 6]
Input [1]: [shardId#6608407]
Keys [1]: [shardId#6608407]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#6608407]