digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n61 ms (0 ms, 6 ms, 7 ms (stage 60899.0: task 149663))";
tooltip="WholeStageCodegen (2)";
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, 2 ms (stage 60899.0: task 149663))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 60899.0: task 149664))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#722686], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 11<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 11<br>local bytes read: 644.0 B<br>merged fetch fallback count: 0<br>local blocks read: 7<br>remote merged chunks fetched: 0<br>remote blocks read: 4<br>data size total (min, med, max (stageId: taskId))<br>352.0 B (32.0 B, 32.0 B, 32.0 B (stage 60898.0: task 149649))<br>local merged bytes read: 0.0 B<br>local merged chunks fetched: 0<br>shuffle write time total (min, med, max (stageId: taskId))<br>4 ms (0 ms, 0 ms, 0 ms (stage 60898.0: task 149646))<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: 368.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 total (min, med, max (stageId: taskId))<br>1012.0 B (92.0 B, 92.0 B, 92.0 B (stage 60898.0: task 149649))" tooltip="Exchange hashpartitioning(shardId#722686, 20), ENSURE_REQUIREMENTS, [plan_id=285035]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n433 ms (0 ms, 8 ms, 85 ms (stage 60898.0: task 149644))";
tooltip="WholeStageCodegen (1)";
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>363 ms (0 ms, 6 ms, 79 ms (stage 60898.0: task 149644))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 60898.0: task 149650))<br>number of output rows: 11<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#722686], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#722686]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 14" tooltip="Filter (isnotnull(shardId#722686) AND (shardId#722686 = 0_1_10000002107))"];
7 [id="node7" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 14" tooltip="Scan ExistingRDD[shardId#722686,orderProposalId#722687L,items#722688,optimizationGroups#722689,isOptimal#722690,lastModified#722691,optimizationInsights#722692]"];
}
2->1;
4->2;
5->4;
6->5;
7->6;
}
== Physical Plan ==
* HashAggregate (6)
+- Exchange (5)
+- * HashAggregate (4)
+- * Project (3)
+- * Filter (2)
+- * Scan ExistingRDD (1)
(1) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#722686, orderProposalId#722687L, items#722688, optimizationGroups#722689, isOptimal#722690, lastModified#722691, optimizationInsights#722692]
Arguments: [shardId#722686, orderProposalId#722687L, items#722688, optimizationGroups#722689, isOptimal#722690, lastModified#722691, optimizationInsights#722692], MapPartitionsRDD[33933] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(2) Filter [codegen id : 1]
Input [7]: [shardId#722686, orderProposalId#722687L, items#722688, optimizationGroups#722689, isOptimal#722690, lastModified#722691, optimizationInsights#722692]
Condition : (isnotnull(shardId#722686) AND (shardId#722686 = 0_1_10000002107))
(3) Project [codegen id : 1]
Output [1]: [shardId#722686]
Input [7]: [shardId#722686, orderProposalId#722687L, items#722688, optimizationGroups#722689, isOptimal#722690, lastModified#722691, optimizationInsights#722692]
(4) HashAggregate [codegen id : 1]
Input [1]: [shardId#722686]
Keys [1]: [shardId#722686]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#722686]
(5) Exchange
Input [1]: [shardId#722686]
Arguments: hashpartitioning(shardId#722686, 20), ENSURE_REQUIREMENTS, [plan_id=285035]
(6) HashAggregate [codegen id : 2]
Input [1]: [shardId#722686]
Keys [1]: [shardId#722686]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#722686]