digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n115 ms (0 ms, 4 ms, 14 ms (stage 312007.0: task 896639))";
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>10 ms (0 ms, 0 ms, 3 ms (stage 312007.0: task 896645))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 312007.0: task 896640))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#3429646], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 0<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 0<br>local bytes read: 0.0 B<br>merged fetch fallback count: 0<br>local blocks read: 0<br>remote merged chunks fetched: 0<br>remote blocks read: 0<br>data size: 0.0 B<br>local merged bytes read: 0.0 B<br>local merged chunks fetched: 0<br>shuffle write time: 0 ms<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: 30<br>remote reqs duration: 0 ms<br>remote bytes read to disk: 0.0 B<br>shuffle bytes written: 0.0 B" tooltip="Exchange hashpartitioning(shardId#3429646, 30), ENSURE_REQUIREMENTS, [plan_id=986101]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n950 ms (0 ms, 5 ms, 179 ms (stage 312006.0: task 896613))";
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>22 ms (0 ms, 0 ms, 7 ms (stage 312006.0: task 896610))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 312006.0: task 896606))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#3429646], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#3429646]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isOptimal#3429650 <=> false)"];
}
7 [id="node7" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [isOptimal#3429650, shardId#3429646], [(isOptimal#3429650 <=> false)]"];
subgraph cluster8 {
isCluster="true";
id="cluster8";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n5 ms (0 ms, 0 ms, 1 ms (stage 312006.0: task 896613))";
tooltip="WholeStageCodegen (1)";
9 [id="node9" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#3429646) AND (shardId#3429646 = 0_1_10000000532))"];
10 [id="node10" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#3429646,orderProposalId#3429647L,items#3429648,optimizationGroups#3429649,isOptimal#3429650,lastModified#3429651,optimizationInsights#3429652]"];
}
2->1;
4->2;
5->4;
6->5;
7->6;
9->7;
10->9;
}
== Physical Plan ==
* HashAggregate (9)
+- Exchange (8)
+- * HashAggregate (7)
+- * Project (6)
+- * Filter (5)
+- InMemoryTableScan (1)
+- InMemoryRelation (2)
+- * Filter (4)
+- * Scan ExistingRDD (3)
(1) InMemoryTableScan
Output [2]: [isOptimal#3429650, shardId#3429646]
Arguments: [isOptimal#3429650, shardId#3429646], [(isOptimal#3429650 <=> false)]
(2) InMemoryRelation
Arguments: [shardId#3429646, orderProposalId#3429647L, items#3429648, optimizationGroups#3429649, isOptimal#3429650, lastModified#3429651, optimizationInsights#3429652], StorageLevel(disk, memory, 2 replicas)
(3) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#3429646, orderProposalId#3429647L, items#3429648, optimizationGroups#3429649, isOptimal#3429650, lastModified#3429651, optimizationInsights#3429652]
Arguments: [shardId#3429646, orderProposalId#3429647L, items#3429648, optimizationGroups#3429649, isOptimal#3429650, lastModified#3429651, optimizationInsights#3429652], MapPartitionsRDD[145910] at start at FileStorageAdapterImpl.java:596, ExistingRDD, UnknownPartitioning(0)
(4) Filter [codegen id : 1]
Input [7]: [shardId#3429646, orderProposalId#3429647L, items#3429648, optimizationGroups#3429649, isOptimal#3429650, lastModified#3429651, optimizationInsights#3429652]
Condition : (isnotnull(shardId#3429646) AND (shardId#3429646 = 0_1_10000000532))
(5) Filter [codegen id : 1]
Input [2]: [isOptimal#3429650, shardId#3429646]
Condition : (isOptimal#3429650 <=> false)
(6) Project [codegen id : 1]
Output [1]: [shardId#3429646]
Input [2]: [isOptimal#3429650, shardId#3429646]
(7) HashAggregate [codegen id : 1]
Input [1]: [shardId#3429646]
Keys [1]: [shardId#3429646]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#3429646]
(8) Exchange
Input [1]: [shardId#3429646]
Arguments: hashpartitioning(shardId#3429646, 30), ENSURE_REQUIREMENTS, [plan_id=986101]
(9) HashAggregate [codegen id : 2]
Input [1]: [shardId#3429646]
Keys [1]: [shardId#3429646]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#3429646]