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 83537.0: task 200803))";
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 83537.0: task 200803))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 83537.0: task 200811))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#991586], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 17<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 17<br>local bytes read: 460.0 B<br>merged fetch fallback count: 0<br>local blocks read: 5<br>remote merged chunks fetched: 0<br>remote blocks read: 12<br>data size total (min, med, max (stageId: taskId))<br>544.0 B (32.0 B, 32.0 B, 32.0 B (stage 83536.0: task 200784))<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 83536.0: task 200786))<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: 1104.0 B<br>number of partitions: 20<br>remote reqs duration: 1 ms<br>remote bytes read to disk: 0.0 B<br>shuffle bytes written total (min, med, max (stageId: taskId))<br>1564.0 B (92.0 B, 92.0 B, 92.0 B (stage 83536.0: task 200784))" tooltip="Exchange hashpartitioning(shardId#991586, 20), ENSURE_REQUIREMENTS, [plan_id=383415]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n367 ms (0 ms, 10 ms, 60 ms (stage 83536.0: task 200787))";
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>293 ms (0 ms, 2 ms, 55 ms (stage 83536.0: task 200787))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 83536.0: task 200783))<br>number of output rows: 17<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#991586], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#991586]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 34" tooltip="Filter (isnotnull(shardId#991586) AND (shardId#991586 = 0_1_10000002110))"];
7 [id="node7" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 34" tooltip="Scan ExistingRDD[shardId#991586,worklistShardItemId#991587L,qty#991588,demandChannel#991589,demandStream#991590,kpis#991591]"];
}
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#991586, worklistShardItemId#991587L, qty#991588, demandChannel#991589, demandStream#991590, kpis#991591]
Arguments: [shardId#991586, worklistShardItemId#991587L, qty#991588, demandChannel#991589, demandStream#991590, kpis#991591], MapPartitionsRDD[46360] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(2) Filter [codegen id : 1]
Input [6]: [shardId#991586, worklistShardItemId#991587L, qty#991588, demandChannel#991589, demandStream#991590, kpis#991591]
Condition : (isnotnull(shardId#991586) AND (shardId#991586 = 0_1_10000002110))
(3) Project [codegen id : 1]
Output [1]: [shardId#991586]
Input [6]: [shardId#991586, worklistShardItemId#991587L, qty#991588, demandChannel#991589, demandStream#991590, kpis#991591]
(4) HashAggregate [codegen id : 1]
Input [1]: [shardId#991586]
Keys [1]: [shardId#991586]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#991586]
(5) Exchange
Input [1]: [shardId#991586]
Arguments: hashpartitioning(shardId#991586, 20), ENSURE_REQUIREMENTS, [plan_id=383415]
(6) HashAggregate [codegen id : 2]
Input [1]: [shardId#991586]
Keys [1]: [shardId#991586]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#991586]