digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n49 ms (0 ms, 0 ms, 6 ms (stage 1036384.0: task 2670612))";
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>5 ms (0 ms, 0 ms, 3 ms (stage 1036384.0: task 2670612))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1036384.0: task 2670630))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#10225054], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 30<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 30<br>local bytes read: 1196.0 B<br>merged fetch fallback count: 0<br>local blocks read: 13<br>remote merged chunks fetched: 0<br>remote blocks read: 17<br>data size total (min, med, max (stageId: taskId))<br>960.0 B (32.0 B, 32.0 B, 32.0 B (stage 1036383.0: task 2670596))<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>26 ms (0 ms, 0 ms, 9 ms (stage 1036383.0: task 2670610))<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: 1564.0 B<br>number of partitions: 30<br>remote reqs duration: 7 ms<br>remote bytes read to disk: 0.0 B<br>shuffle bytes written total (min, med, max (stageId: taskId))<br>2.7 KiB (92.0 B, 92.0 B, 92.0 B (stage 1036383.0: task 2670596))" tooltip="Exchange hashpartitioning(shardId#10225054, 30), ENSURE_REQUIREMENTS, [plan_id=3021953]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n1.5 s (13 ms, 27 ms, 126 ms (stage 1036383.0: task 2670586))";
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>1.2 s (11 ms, 20 ms, 95 ms (stage 1036383.0: task 2670586))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1036383.0: task 2670596))<br>number of output rows: 30<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#10225054], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#10225054]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 2,354" tooltip="Filter (isnotnull(shardId#10225054) AND (shardId#10225054 = 0_3_10000000540))"];
7 [id="node7" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 4,403" tooltip="Scan ExistingRDD[shardId#10225054,orderProposalId#10225055L,items#10225056,optimizationGroups#10225057,isOptimal#10225058,lastModified#10225059,optimizationInsights#10225060]"];
}
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#10225054, orderProposalId#10225055L, items#10225056, optimizationGroups#10225057, isOptimal#10225058, lastModified#10225059, optimizationInsights#10225060]
Arguments: [shardId#10225054, orderProposalId#10225055L, items#10225056, optimizationGroups#10225057, isOptimal#10225058, lastModified#10225059, optimizationInsights#10225060], MapPartitionsRDD[434732] at start at FileStorageAdapterImpl.java:596, ExistingRDD, UnknownPartitioning(0)
(2) Filter [codegen id : 1]
Input [7]: [shardId#10225054, orderProposalId#10225055L, items#10225056, optimizationGroups#10225057, isOptimal#10225058, lastModified#10225059, optimizationInsights#10225060]
Condition : (isnotnull(shardId#10225054) AND (shardId#10225054 = 0_3_10000000540))
(3) Project [codegen id : 1]
Output [1]: [shardId#10225054]
Input [7]: [shardId#10225054, orderProposalId#10225055L, items#10225056, optimizationGroups#10225057, isOptimal#10225058, lastModified#10225059, optimizationInsights#10225060]
(4) HashAggregate [codegen id : 1]
Input [1]: [shardId#10225054]
Keys [1]: [shardId#10225054]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#10225054]
(5) Exchange
Input [1]: [shardId#10225054]
Arguments: hashpartitioning(shardId#10225054, 30), ENSURE_REQUIREMENTS, [plan_id=3021953]
(6) HashAggregate [codegen id : 2]
Input [1]: [shardId#10225054]
Keys [1]: [shardId#10225054]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#10225054]