digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n2 ms (0 ms, 0 ms, 2 ms (stage 69411.0: task 175755))";
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>1 ms (0 ms, 0 ms, 1 ms (stage 69411.0: task 175755))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 69411.0: task 175759))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#858055], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 16<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 16<br>local bytes read: 1012.0 B<br>merged fetch fallback count: 0<br>local blocks read: 11<br>remote merged chunks fetched: 0<br>remote blocks read: 5<br>data size total (min, med, max (stageId: taskId))<br>512.0 B (32.0 B, 32.0 B, 32.0 B (stage 69410.0: task 175742))<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>6 ms (0 ms, 0 ms, 0 ms (stage 69410.0: task 175743))<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: 460.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>1472.0 B (92.0 B, 92.0 B, 92.0 B (stage 69410.0: task 175742))" tooltip="Exchange hashpartitioning(shardId#858055, 20), ENSURE_REQUIREMENTS, [plan_id=337584]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n363 ms (0 ms, 6 ms, 61 ms (stage 69410.0: task 175735))";
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>291 ms (0 ms, 2 ms, 54 ms (stage 69410.0: task 175735))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 69410.0: task 175740))<br>number of output rows: 16<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#858055], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#858055]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 26" tooltip="Filter (isnotnull(shardId#858055) AND (shardId#858055 = 0_1_10000002109))"];
7 [id="node7" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 26" tooltip="Scan ExistingRDD[shardId#858055,worklistShardItemId#858056L,qty#858057,demandChannel#858058,demandStream#858059,kpis#858060]"];
}
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 [6]: [shardId#858055, worklistShardItemId#858056L, qty#858057, demandChannel#858058, demandStream#858059, kpis#858060]
Arguments: [shardId#858055, worklistShardItemId#858056L, qty#858057, demandChannel#858058, demandStream#858059, kpis#858060], MapPartitionsRDD[40195] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(2) Filter [codegen id : 1]
Input [6]: [shardId#858055, worklistShardItemId#858056L, qty#858057, demandChannel#858058, demandStream#858059, kpis#858060]
Condition : (isnotnull(shardId#858055) AND (shardId#858055 = 0_1_10000002109))
(3) Project [codegen id : 1]
Output [1]: [shardId#858055]
Input [6]: [shardId#858055, worklistShardItemId#858056L, qty#858057, demandChannel#858058, demandStream#858059, kpis#858060]
(4) HashAggregate [codegen id : 1]
Input [1]: [shardId#858055]
Keys [1]: [shardId#858055]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#858055]
(5) Exchange
Input [1]: [shardId#858055]
Arguments: hashpartitioning(shardId#858055, 20), ENSURE_REQUIREMENTS, [plan_id=337584]
(6) HashAggregate [codegen id : 2]
Input [1]: [shardId#858055]
Keys [1]: [shardId#858055]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#858055]