digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (6)\n \nduration: total (min, med, max (stageId: taskId))\n70 ms (0 ms, 7 ms, 7 ms (stage 48343.0: task 132769))";
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>3 ms (0 ms, 0 ms, 2 ms (stage 48343.0: task 132770))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 48343.0: task 132769))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#632615], 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#632615, 20), ENSURE_REQUIREMENTS, [plan_id=262009]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (5)\n \nduration: total (min, med, max (stageId: taskId))\n242 ms (0 ms, 13 ms, 34 ms (stage 48342.0: task 132752))";
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>35 ms (0 ms, 3 ms, 4 ms (stage 48342.0: task 132751))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 48342.0: task 132751))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#632615], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#632615]"];
6 [id="node6" labelType="html" label="<b>Generate</b><br><br>number of output rows: 0" tooltip="Generate explode(optimizationInsights#632621), [shardId#632615], false, [insight#636942]"];
7 [id="node7" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#632615, optimizationInsights#632621]"];
8 [id="node8" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [orderProposalId#632616L], [orderProposalId#633328L], 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>2 ms (0 ms, 0 ms, 1 ms (stage 48342.0: task 132748))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 48342.0: task 132751))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#633328L], 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: 98 ms<br>number of output rows: 6<br>data size: 1024.3 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=261978]"];
subgraph cluster10 {
isCluster="true";
id="cluster10";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n3 ms (0 ms, 0 ms, 1 ms (stage 48338.0: task 132665))";
tooltip="WholeStageCodegen (1)";
11 [id="node11" labelType="html" label="<b>Filter</b><br><br>number of output rows: 6" tooltip="Filter ((isnotnull(orderProposalId#632616L) AND (size(optimizationInsights#632621, true) > 0)) AND isnotnull(optimizationInsights#632621))"];
}
12 [id="node12" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 14" tooltip="InMemoryTableScan [shardId#632615, orderProposalId#632616L, optimizationInsights#632621], [isnotnull(orderProposalId#632616L), (size(optimizationInsights#632621, true) > 0), isnotnull(optimizationInsights#632621)]"];
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#632615) AND (shardId#632615 = 0_1_10000002107))"];
}
15 [id="node15" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, optimizationInsights#632621], [isnotnull(shardId#632615), (shardId#632615 = 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#632615) AND (shardId#632615 = 0_1_10000002107))"];
18 [id="node18" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#632615,orderProposalId#632616L,items#632617,optimizationGroups#632618,isOptimal#632619,lastModified#632620,optimizationInsights#632621]"];
}
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#633328L, 20), ENSURE_REQUIREMENTS, [plan_id=262000]"];
subgraph cluster21 {
isCluster="true";
id="cluster21";
label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n262 ms (0 ms, 11 ms, 41 ms (stage 48341.0: task 132731))";
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>6 ms (0 ms, 0 ms, 2 ms (stage 48341.0: task 132732))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 48341.0: task 132730))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#633328L], functions=[])"];
23 [id="node23" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#633328L]"];
24 [id="node24" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [worklistShardItemId#633127L], [worklistShardItemId#633351L], Inner, BuildLeft, false"];
38 [id="node38" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [worklistShardItemId#633351L, orderProposalId#633328L]"];
}
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: 129 ms<br>number of output rows: 205<br>data size: 1032.0 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=261986]"];
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 48339.0: task 132672))";
tooltip="WholeStageCodegen (2)";
27 [id="node27" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [item#633126L AS worklistShardItemId#633127L]"];
28 [id="node28" labelType="html" label="<b>Generate</b><br><br>number of output rows: 205" tooltip="Generate explode(_extract_worklistShardItemId#637073), false, [item#633126L]"];
29 [id="node29" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [items#636936.worklistShardItemId AS _extract_worklistShardItemId#637073]"];
30 [id="node30" labelType="html" label="<b>Filter</b><br><br>number of output rows: 14" tooltip="Filter (((size(items#636936.worklistShardItemId, true) > 0) AND isnotnull(items#636936.worklistShardItemId)) AND (shardId#636934 = 0_1_10000002107))"];
}
31 [id="node31" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 14" tooltip="InMemoryTableScan [items#636936, shardId#636934], [(size(items#636936.worklistShardItemId, true) > 0), isnotnull(items#636936.worklistShardItemId), (shardId#636934 = 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#632615) AND (shardId#632615 = 0_1_10000002107))"];
}
34 [id="node34" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, optimizationInsights#632621], [isnotnull(shardId#632615), (shardId#632615 = 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#632615) AND (shardId#632615 = 0_1_10000002107))"];
37 [id="node37" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#632615,orderProposalId#632616L,items#632617,optimizationGroups#632618,isOptimal#632619,lastModified#632620,optimizationInsights#632621]"];
}
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#633351L, 20), REPARTITION_BY_NUM, [plan_id=261993]"];
subgraph cluster40 {
isCluster="true";
id="cluster40";
label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n1.5 s (49 ms, 58 ms, 72 ms (stage 48340.0: task 132706))";
tooltip="WholeStageCodegen (3)";
41 [id="node41" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#633328L, worklistShardItemId#633351L]"];
42 [id="node42" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter ((isnotnull(worklistShardItemId#633351L) AND NOT (isFallbackOrderOnly#633345 <=> true)) AND isnotnull(orderProposalId#633328L))"];
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.5 s (48 ms, 57 ms, 70 ms (stage 48340.0: task 132706))<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#633328L,isFallbackOrderOnly#633345,worklistShardItemId#633351L,shardId#633372,sequenceId#633350] Batched: true, DataFilters: [isnotnull(worklistShardItemId#633351L), NOT (isFallbackOrderOnly#633345 <=> true), isnotnull(ord..., Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#633372), isnotnull(sequenceId#633350), (shardId#633372 = 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#632615, orderProposalId#632616L, optimizationInsights#632621]
Arguments: [shardId#632615, orderProposalId#632616L, optimizationInsights#632621], [isnotnull(orderProposalId#632616L), (size(optimizationInsights#632621, true) > 0), isnotnull(optimizationInsights#632621)]
(2) InMemoryRelation
Arguments: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, optimizationInsights#632621], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, optimizationInsights#632621]
Arguments: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, optimizationInsights#632621], [isnotnull(shardId#632615), (shardId#632615 = 0_1_10000002107)]
(4) InMemoryRelation
Arguments: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, lastModified#632620, optimizationInsights#632621], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, lastModified#632620, optimizationInsights#632621]
Arguments: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, lastModified#632620, optimizationInsights#632621], MapPartitionsRDD[30129] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, lastModified#632620, optimizationInsights#632621]
Condition : (isnotnull(shardId#632615) AND (shardId#632615 = 0_1_10000002107))
(7) Filter [codegen id : 1]
Input [6]: [shardId#632615, orderProposalId#632616L, items#632617, optimizationGroups#632618, isOptimal#632619, optimizationInsights#632621]
Condition : (isnotnull(shardId#632615) AND (shardId#632615 = 0_1_10000002107))
(8) Filter [codegen id : 1]
Input [3]: [shardId#632615, orderProposalId#632616L, optimizationInsights#632621]
Condition : ((isnotnull(orderProposalId#632616L) AND (size(optimizationInsights#632621, true) > 0)) AND isnotnull(optimizationInsights#632621))
(9) BroadcastExchange
Input [3]: [shardId#632615, orderProposalId#632616L, optimizationInsights#632621]
Arguments: HashedRelationBroadcastMode(List(input[1, bigint, false]),false), [plan_id=261978]
(10) InMemoryTableScan
Output [2]: [items#636936, shardId#636934]
Arguments: [items#636936, shardId#636934], [(size(items#636936.worklistShardItemId, true) > 0), isnotnull(items#636936.worklistShardItemId), (shardId#636934 = 0_1_10000002107)]
(11) InMemoryRelation
Arguments: [shardId#636934, orderProposalId#636935L, items#636936, optimizationGroups#636937, isOptimal#636938, optimizationInsights#636940], StorageLevel(disk, memory, 2 replicas)
(12) Filter [codegen id : 2]
Input [2]: [items#636936, shardId#636934]
Condition : (((size(items#636936.worklistShardItemId, true) > 0) AND isnotnull(items#636936.worklistShardItemId)) AND (shardId#636934 = 0_1_10000002107))
(13) Project [codegen id : 2]
Output [1]: [items#636936.worklistShardItemId AS _extract_worklistShardItemId#637073]
Input [2]: [items#636936, shardId#636934]
(14) Generate [codegen id : 2]
Input [1]: [_extract_worklistShardItemId#637073]
Arguments: explode(_extract_worklistShardItemId#637073), false, [item#633126L]
(15) Project [codegen id : 2]
Output [1]: [item#633126L AS worklistShardItemId#633127L]
Input [1]: [item#633126L]
(16) BroadcastExchange
Input [1]: [worklistShardItemId#633127L]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=261986]
(17) Scan parquet
Output [5]: [orderProposalId#633328L, isFallbackOrderOnly#633345, worklistShardItemId#633351L, shardId#633372, sequenceId#633350]
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#633372), isnotnull(sequenceId#633350), (shardId#633372 = 0_1_10000002107), (sequenceId#633350 = 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#633328L, isFallbackOrderOnly#633345, worklistShardItemId#633351L, shardId#633372, sequenceId#633350]
(19) Filter [codegen id : 3]
Input [5]: [orderProposalId#633328L, isFallbackOrderOnly#633345, worklistShardItemId#633351L, shardId#633372, sequenceId#633350]
Condition : ((isnotnull(worklistShardItemId#633351L) AND NOT (isFallbackOrderOnly#633345 <=> true)) AND isnotnull(orderProposalId#633328L))
(20) Project [codegen id : 3]
Output [2]: [orderProposalId#633328L, worklistShardItemId#633351L]
Input [5]: [orderProposalId#633328L, isFallbackOrderOnly#633345, worklistShardItemId#633351L, shardId#633372, sequenceId#633350]
(21) Exchange
Input [2]: [orderProposalId#633328L, worklistShardItemId#633351L]
Arguments: hashpartitioning(worklistShardItemId#633351L, 20), REPARTITION_BY_NUM, [plan_id=261993]
(22) Project
Output [2]: [worklistShardItemId#633351L, orderProposalId#633328L]
Input [2]: [orderProposalId#633328L, worklistShardItemId#633351L]
(23) BroadcastHashJoin [codegen id : 4]
Left keys [1]: [worklistShardItemId#633127L]
Right keys [1]: [worklistShardItemId#633351L]
Join type: Inner
Join condition: None
(24) Project [codegen id : 4]
Output [1]: [orderProposalId#633328L]
Input [3]: [worklistShardItemId#633127L, worklistShardItemId#633351L, orderProposalId#633328L]
(25) HashAggregate [codegen id : 4]
Input [1]: [orderProposalId#633328L]
Keys [1]: [orderProposalId#633328L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#633328L]
(26) Exchange
Input [1]: [orderProposalId#633328L]
Arguments: hashpartitioning(orderProposalId#633328L, 20), ENSURE_REQUIREMENTS, [plan_id=262000]
(27) HashAggregate
Input [1]: [orderProposalId#633328L]
Keys [1]: [orderProposalId#633328L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#633328L]
(28) BroadcastHashJoin [codegen id : 5]
Left keys [1]: [orderProposalId#632616L]
Right keys [1]: [orderProposalId#633328L]
Join type: Inner
Join condition: None
(29) Project [codegen id : 5]
Output [2]: [shardId#632615, optimizationInsights#632621]
Input [4]: [shardId#632615, orderProposalId#632616L, optimizationInsights#632621, orderProposalId#633328L]
(30) Generate [codegen id : 5]
Input [2]: [shardId#632615, optimizationInsights#632621]
Arguments: explode(optimizationInsights#632621), [shardId#632615], false, [insight#636942]
(31) Project [codegen id : 5]
Output [1]: [shardId#632615]
Input [2]: [shardId#632615, insight#636942]
(32) HashAggregate [codegen id : 5]
Input [1]: [shardId#632615]
Keys [1]: [shardId#632615]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#632615]
(33) Exchange
Input [1]: [shardId#632615]
Arguments: hashpartitioning(shardId#632615, 20), ENSURE_REQUIREMENTS, [plan_id=262009]
(34) HashAggregate [codegen id : 6]
Input [1]: [shardId#632615]
Keys [1]: [shardId#632615]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#632615]