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 56747.0: task 145560))";
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>4 ms (0 ms, 0 ms, 1 ms (stage 56747.0: task 145560))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 56747.0: task 145560))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#691888], 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: 20<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#691888, 20), ENSURE_REQUIREMENTS, [plan_id=279472]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (5)\n \nduration: total (min, med, max (stageId: taskId))\n406 ms (0 ms, 38 ms, 42 ms (stage 56746.0: task 145544))";
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>43 ms (0 ms, 3 ms, 5 ms (stage 56746.0: task 145541))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 56746.0: task 145544))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#691888], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#691888]"];
6 [id="node6" labelType="html" label="<b>Generate</b><br><br>number of output rows: 0" tooltip="Generate explode(optimizationInsights#691894), [shardId#691888], false, [insight#696215]"];
7 [id="node7" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#691888, optimizationInsights#691894]"];
8 [id="node8" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [orderProposalId#691889L], [orderProposalId#692601L], 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>5 ms (0 ms, 0 ms, 2 ms (stage 56746.0: task 145543))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 56746.0: task 145544))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#692601L], 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: 67 ms<br>number of output rows: 6<br>data size: 1024.3 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=279441]"];
subgraph cluster10 {
isCluster="true";
id="cluster10";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n2 ms (0 ms, 0 ms, 1 ms (stage 56742.0: task 145455))";
tooltip="WholeStageCodegen (1)";
11 [id="node11" labelType="html" label="<b>Filter</b><br><br>number of output rows: 6" tooltip="Filter ((isnotnull(orderProposalId#691889L) AND (size(optimizationInsights#691894, true) > 0)) AND isnotnull(optimizationInsights#691894))"];
}
12 [id="node12" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 14" tooltip="InMemoryTableScan [shardId#691888, orderProposalId#691889L, optimizationInsights#691894], [isnotnull(orderProposalId#691889L), (size(optimizationInsights#691894, true) > 0), isnotnull(optimizationInsights#691894)]"];
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#691888) AND (shardId#691888 = 0_1_10000002107))"];
}
15 [id="node15" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, optimizationInsights#691894], [isnotnull(shardId#691888), (shardId#691888 = 0_1_10000002107)]"];
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#691888) AND (shardId#691888 = 0_1_10000002107))"];
18 [id="node18" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#691888,orderProposalId#691889L,items#691890,optimizationGroups#691891,isOptimal#691892,lastModified#691893,optimizationInsights#691894]"];
}
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: 20<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#692601L, 20), ENSURE_REQUIREMENTS, [plan_id=279463]"];
subgraph cluster21 {
isCluster="true";
id="cluster21";
label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n440 ms (0 ms, 9 ms, 79 ms (stage 56745.0: task 145528))";
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>4 ms (0 ms, 0 ms, 1 ms (stage 56745.0: task 145521))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 56745.0: task 145527))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#692601L], functions=[])"];
23 [id="node23" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#692601L]"];
24 [id="node24" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [worklistShardItemId#692400L], [worklistShardItemId#692624L], Inner, BuildLeft, false"];
38 [id="node38" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [worklistShardItemId#692624L, orderProposalId#692601L]"];
}
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: 92 ms<br>number of output rows: 205<br>data size: 1032.0 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=279449]"];
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 56743.0: task 145464))";
tooltip="WholeStageCodegen (2)";
27 [id="node27" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [item#692399L AS worklistShardItemId#692400L]"];
28 [id="node28" labelType="html" label="<b>Generate</b><br><br>number of output rows: 205" tooltip="Generate explode(_extract_worklistShardItemId#696346), false, [item#692399L]"];
29 [id="node29" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [items#696209.worklistShardItemId AS _extract_worklistShardItemId#696346]"];
30 [id="node30" labelType="html" label="<b>Filter</b><br><br>number of output rows: 14" tooltip="Filter (((size(items#696209.worklistShardItemId, true) > 0) AND isnotnull(items#696209.worklistShardItemId)) AND (shardId#696207 = 0_1_10000002107))"];
}
31 [id="node31" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 14" tooltip="InMemoryTableScan [items#696209, shardId#696207], [(size(items#696209.worklistShardItemId, true) > 0), isnotnull(items#696209.worklistShardItemId), (shardId#696207 = 0_1_10000002107)]"];
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#691888) AND (shardId#691888 = 0_1_10000002107))"];
}
34 [id="node34" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, optimizationInsights#691894], [isnotnull(shardId#691888), (shardId#691888 = 0_1_10000002107)]"];
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#691888) AND (shardId#691888 = 0_1_10000002107))"];
37 [id="node37" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#691888,orderProposalId#691889L,items#691890,optimizationGroups#691891,isOptimal#691892,lastModified#691893,optimizationInsights#691894]"];
}
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: 20<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#692624L, 20), REPARTITION_BY_NUM, [plan_id=279456]"];
subgraph cluster40 {
isCluster="true";
id="cluster40";
label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n1.8 s (53 ms, 73 ms, 99 ms (stage 56744.0: task 145495))";
tooltip="WholeStageCodegen (3)";
41 [id="node41" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#692601L, worklistShardItemId#692624L]"];
42 [id="node42" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter ((isnotnull(worklistShardItemId#692624L) AND NOT (isFallbackOrderOnly#692618 <=> true)) AND isnotnull(orderProposalId#692601L))"];
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: 25<br>scan time total (min, med, max (stageId: taskId))<br>1.8 s (53 ms, 71 ms, 97 ms (stage 56744.0: task 145495))<br>dynamic partition pruning time: 0 ms<br>metadata time: 0 ms<br>size of files read: 520.6 KiB<br>number of output rows: 0<br>number of partitions read: 1" tooltip="FileScan parquet [orderProposalId#692601L,isFallbackOrderOnly#692618,worklistShardItemId#692624L,shardId#692645,sequenceId#692623] Batched: true, DataFilters: [isnotnull(worklistShardItemId#692624L), NOT (isFallbackOrderOnly#692618 <=> true), isnotnull(ord..., Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#692645), isnotnull(sequenceId#692623), (shardId#692645 = 0_1_10000002107), (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;
}
== 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#691888, orderProposalId#691889L, optimizationInsights#691894]
Arguments: [shardId#691888, orderProposalId#691889L, optimizationInsights#691894], [isnotnull(orderProposalId#691889L), (size(optimizationInsights#691894, true) > 0), isnotnull(optimizationInsights#691894)]
(2) InMemoryRelation
Arguments: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, optimizationInsights#691894], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, optimizationInsights#691894]
Arguments: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, optimizationInsights#691894], [isnotnull(shardId#691888), (shardId#691888 = 0_1_10000002107)]
(4) InMemoryRelation
Arguments: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, lastModified#691893, optimizationInsights#691894], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, lastModified#691893, optimizationInsights#691894]
Arguments: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, lastModified#691893, optimizationInsights#691894], MapPartitionsRDD[32831] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, lastModified#691893, optimizationInsights#691894]
Condition : (isnotnull(shardId#691888) AND (shardId#691888 = 0_1_10000002107))
(7) Filter [codegen id : 1]
Input [6]: [shardId#691888, orderProposalId#691889L, items#691890, optimizationGroups#691891, isOptimal#691892, optimizationInsights#691894]
Condition : (isnotnull(shardId#691888) AND (shardId#691888 = 0_1_10000002107))
(8) Filter [codegen id : 1]
Input [3]: [shardId#691888, orderProposalId#691889L, optimizationInsights#691894]
Condition : ((isnotnull(orderProposalId#691889L) AND (size(optimizationInsights#691894, true) > 0)) AND isnotnull(optimizationInsights#691894))
(9) BroadcastExchange
Input [3]: [shardId#691888, orderProposalId#691889L, optimizationInsights#691894]
Arguments: HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=279441]
(10) InMemoryTableScan
Output [2]: [items#696209, shardId#696207]
Arguments: [items#696209, shardId#696207], [(size(items#696209.worklistShardItemId, true) > 0), isnotnull(items#696209.worklistShardItemId), (shardId#696207 = 0_1_10000002107)]
(11) InMemoryRelation
Arguments: [shardId#696207, orderProposalId#696208L, items#696209, optimizationGroups#696210, isOptimal#696211, optimizationInsights#696213], StorageLevel(disk, memory, 2 replicas)
(12) Filter [codegen id : 2]
Input [2]: [items#696209, shardId#696207]
Condition : (((size(items#696209.worklistShardItemId, true) > 0) AND isnotnull(items#696209.worklistShardItemId)) AND (shardId#696207 = 0_1_10000002107))
(13) Project [codegen id : 2]
Output [1]: [items#696209.worklistShardItemId AS _extract_worklistShardItemId#696346]
Input [2]: [items#696209, shardId#696207]
(14) Generate [codegen id : 2]
Input [1]: [_extract_worklistShardItemId#696346]
Arguments: explode(_extract_worklistShardItemId#696346), false, [item#692399L]
(15) Project [codegen id : 2]
Output [1]: [item#692399L AS worklistShardItemId#692400L]
Input [1]: [item#692399L]
(16) BroadcastExchange
Input [1]: [worklistShardItemId#692400L]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=279449]
(17) Scan parquet
Output [5]: [orderProposalId#692601L, isFallbackOrderOnly#692618, worklistShardItemId#692624L, shardId#692645, sequenceId#692623]
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/10000002107]
PartitionFilters: [isnotnull(shardId#692645), isnotnull(sequenceId#692623), (shardId#692645 = 0_1_10000002107), (sequenceId#692623 = 5)]
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#692601L, isFallbackOrderOnly#692618, worklistShardItemId#692624L, shardId#692645, sequenceId#692623]
(19) Filter [codegen id : 3]
Input [5]: [orderProposalId#692601L, isFallbackOrderOnly#692618, worklistShardItemId#692624L, shardId#692645, sequenceId#692623]
Condition : ((isnotnull(worklistShardItemId#692624L) AND NOT (isFallbackOrderOnly#692618 <=> true)) AND isnotnull(orderProposalId#692601L))
(20) Project [codegen id : 3]
Output [2]: [orderProposalId#692601L, worklistShardItemId#692624L]
Input [5]: [orderProposalId#692601L, isFallbackOrderOnly#692618, worklistShardItemId#692624L, shardId#692645, sequenceId#692623]
(21) Exchange
Input [2]: [orderProposalId#692601L, worklistShardItemId#692624L]
Arguments: hashpartitioning(worklistShardItemId#692624L, 20), REPARTITION_BY_NUM, [plan_id=279456]
(22) Project
Output [2]: [worklistShardItemId#692624L, orderProposalId#692601L]
Input [2]: [orderProposalId#692601L, worklistShardItemId#692624L]
(23) BroadcastHashJoin [codegen id : 4]
Left keys [1]: [worklistShardItemId#692400L]
Right keys [1]: [worklistShardItemId#692624L]
Join type: Inner
Join condition: None
(24) Project [codegen id : 4]
Output [1]: [orderProposalId#692601L]
Input [3]: [worklistShardItemId#692400L, worklistShardItemId#692624L, orderProposalId#692601L]
(25) HashAggregate [codegen id : 4]
Input [1]: [orderProposalId#692601L]
Keys [1]: [orderProposalId#692601L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#692601L]
(26) Exchange
Input [1]: [orderProposalId#692601L]
Arguments: hashpartitioning(orderProposalId#692601L, 20), ENSURE_REQUIREMENTS, [plan_id=279463]
(27) HashAggregate
Input [1]: [orderProposalId#692601L]
Keys [1]: [orderProposalId#692601L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#692601L]
(28) BroadcastHashJoin [codegen id : 5]
Left keys [1]: [orderProposalId#691889L]
Right keys [1]: [orderProposalId#692601L]
Join type: Inner
Join condition: None
(29) Project [codegen id : 5]
Output [2]: [shardId#691888, optimizationInsights#691894]
Input [4]: [shardId#691888, orderProposalId#691889L, optimizationInsights#691894, orderProposalId#692601L]
(30) Generate [codegen id : 5]
Input [2]: [shardId#691888, optimizationInsights#691894]
Arguments: explode(optimizationInsights#691894), [shardId#691888], false, [insight#696215]
(31) Project [codegen id : 5]
Output [1]: [shardId#691888]
Input [2]: [shardId#691888, insight#696215]
(32) HashAggregate [codegen id : 5]
Input [1]: [shardId#691888]
Keys [1]: [shardId#691888]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#691888]
(33) Exchange
Input [1]: [shardId#691888]
Arguments: hashpartitioning(shardId#691888, 20), ENSURE_REQUIREMENTS, [plan_id=279472]
(34) HashAggregate [codegen id : 6]
Input [1]: [shardId#691888]
Keys [1]: [shardId#691888]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#691888]