digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n90 ms (0 ms, 0 ms, 30 ms (stage 309449.0: task 893687))";
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>8 ms (0 ms, 0 ms, 5 ms (stage 309449.0: task 893687))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 309449.0: task 893662))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#3425144], 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: 2.2 KiB<br>merged fetch fallback count: 0<br>local blocks read: 24<br>remote merged chunks fetched: 0<br>remote blocks read: 6<br>data size total (min, med, max (stageId: taskId))<br>960.0 B (32.0 B, 32.0 B, 32.0 B (stage 309448.0: task 893622))<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>15 ms (0 ms, 0 ms, 0 ms (stage 309448.0: task 893644))<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: 552.0 B<br>number of partitions: 30<br>remote reqs duration: 4 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 309448.0: task 893622))" tooltip="Exchange hashpartitioning(shardId#3425144, 30), ENSURE_REQUIREMENTS, [plan_id=984363]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n3.4 s (14 ms, 19 ms, 492 ms (stage 309448.0: task 893645))";
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>2.0 s (13 ms, 18 ms, 265 ms (stage 309448.0: task 893637))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 309448.0: task 893622))<br>number of output rows: 30<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#3425144], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#3425144]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 792" tooltip="Filter (isnotnull(shardId#3425144) AND (shardId#3425144 = 0_7_10000000532))"];
7 [id="node7" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 4,900" tooltip="Scan ExistingRDD[shardId#3425144,orderProposalId#3425145L,items#3425146,optimizationGroups#3425147,isOptimal#3425148,lastModified#3425149,optimizationInsights#3425150]"];
}
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#3425144, orderProposalId#3425145L, items#3425146, optimizationGroups#3425147, isOptimal#3425148, lastModified#3425149, optimizationInsights#3425150]
Arguments: [shardId#3425144, orderProposalId#3425145L, items#3425146, optimizationGroups#3425147, isOptimal#3425148, lastModified#3425149, optimizationInsights#3425150], MapPartitionsRDD[145441] at start at FileStorageAdapterImpl.java:596, ExistingRDD, UnknownPartitioning(0)
(2) Filter [codegen id : 1]
Input [7]: [shardId#3425144, orderProposalId#3425145L, items#3425146, optimizationGroups#3425147, isOptimal#3425148, lastModified#3425149, optimizationInsights#3425150]
Condition : (isnotnull(shardId#3425144) AND (shardId#3425144 = 0_7_10000000532))
(3) Project [codegen id : 1]
Output [1]: [shardId#3425144]
Input [7]: [shardId#3425144, orderProposalId#3425145L, items#3425146, optimizationGroups#3425147, isOptimal#3425148, lastModified#3425149, optimizationInsights#3425150]
(4) HashAggregate [codegen id : 1]
Input [1]: [shardId#3425144]
Keys [1]: [shardId#3425144]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#3425144]
(5) Exchange
Input [1]: [shardId#3425144]
Arguments: hashpartitioning(shardId#3425144, 30), ENSURE_REQUIREMENTS, [plan_id=984363]
(6) HashAggregate [codegen id : 2]
Input [1]: [shardId#3425144]
Keys [1]: [shardId#3425144]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#3425144]