digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n31 ms (0 ms, 0 ms, 7 ms (stage 41122.0: task 119153))";
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 41122.0: task 119153))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 41122.0: task 119157))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#572713], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 12<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 12<br>local bytes read: 1104.0 B<br>merged fetch fallback count: 0<br>local blocks read: 12<br>remote merged chunks fetched: 0<br>remote blocks read: 0<br>data size total (min, med, max (stageId: taskId))<br>384.0 B (32.0 B, 32.0 B, 32.0 B (stage 41121.0: task 119134))<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 41121.0: task 119142))<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 total (min, med, max (stageId: taskId))<br>1104.0 B (92.0 B, 92.0 B, 92.0 B (stage 41121.0: task 119134))" tooltip="Exchange hashpartitioning(shardId#572713, 20), ENSURE_REQUIREMENTS, [plan_id=243534]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n779 ms (0 ms, 7 ms, 146 ms (stage 41121.0: task 119134))";
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>81 ms (0 ms, 6 ms, 8 ms (stage 41121.0: task 119134))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 41121.0: task 119136))<br>number of output rows: 12<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#572713], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#572713]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 14" tooltip="Filter (isnotnull(shardId#572713) AND (shardId#572713 = 0_1_10000002107))"];
7 [id="node7" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 14" tooltip="Scan ExistingRDD[shardId#572713,orderProposalId#572714L,items#572715,optimizationGroups#572716,isOptimal#572717,lastModified#572718,optimizationInsights#572719]"];
}
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#572713, orderProposalId#572714L, items#572715, optimizationGroups#572716, isOptimal#572717, lastModified#572718, optimizationInsights#572719]
Arguments: [shardId#572713, orderProposalId#572714L, items#572715, optimizationGroups#572716, isOptimal#572717, lastModified#572718, optimizationInsights#572719], MapPartitionsRDD[27464] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(2) Filter [codegen id : 1]
Input [7]: [shardId#572713, orderProposalId#572714L, items#572715, optimizationGroups#572716, isOptimal#572717, lastModified#572718, optimizationInsights#572719]
Condition : (isnotnull(shardId#572713) AND (shardId#572713 = 0_1_10000002107))
(3) Project [codegen id : 1]
Output [1]: [shardId#572713]
Input [7]: [shardId#572713, orderProposalId#572714L, items#572715, optimizationGroups#572716, isOptimal#572717, lastModified#572718, optimizationInsights#572719]
(4) HashAggregate [codegen id : 1]
Input [1]: [shardId#572713]
Keys [1]: [shardId#572713]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#572713]
(5) Exchange
Input [1]: [shardId#572713]
Arguments: hashpartitioning(shardId#572713, 20), ENSURE_REQUIREMENTS, [plan_id=243534]
(6) HashAggregate [codegen id : 2]
Input [1]: [shardId#572713]
Keys [1]: [shardId#572713]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#572713]