digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n0 ms (0 ms, 0 ms, 0 ms (stage 74089.0: task 183271))";
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>0 ms (0 ms, 0 ms, 0 ms (stage 74089.0: task 183271))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 74089.0: task 183271))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#893734], 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: 20<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#893734, 20), ENSURE_REQUIREMENTS, [plan_id=349100]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n70 ms (0 ms, 7 ms, 7 ms (stage 74088.0: task 183260))";
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>9 ms (0 ms, 0 ms, 1 ms (stage 74088.0: task 183260))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 74088.0: task 183260))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#893734], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#893734]"];
6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isOptimal#893738 <=> false)"];
}
7 [id="node7" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [isOptimal#893738, shardId#893734], [(isOptimal#893738 <=> false)]"];
subgraph cluster8 {
isCluster="true";
id="cluster8";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n60 ms (0 ms, 0 ms, 24 ms (stage 74088.0: task 183259))";
tooltip="WholeStageCodegen (1)";
9 [id="node9" labelType="html" label="<b>Filter</b><br><br>number of output rows: 4" tooltip="Filter (isnotnull(shardId#893734) AND (shardId#893734 = 0_1_10000002109))"];
10 [id="node10" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 4" tooltip="Scan ExistingRDD[shardId#893734,orderProposalId#893735L,items#893736,optimizationGroups#893737,isOptimal#893738,lastModified#893739,optimizationInsights#893740]"];
}
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#893738, shardId#893734]
Arguments: [isOptimal#893738, shardId#893734], [(isOptimal#893738 <=> false)]
(2) InMemoryRelation
Arguments: [shardId#893734, orderProposalId#893735L, items#893736, optimizationGroups#893737, isOptimal#893738, lastModified#893739, optimizationInsights#893740], StorageLevel(disk, memory, 2 replicas)
(3) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#893734, orderProposalId#893735L, items#893736, optimizationGroups#893737, isOptimal#893738, lastModified#893739, optimizationInsights#893740]
Arguments: [shardId#893734, orderProposalId#893735L, items#893736, optimizationGroups#893737, isOptimal#893738, lastModified#893739, optimizationInsights#893740], MapPartitionsRDD[41954] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(4) Filter [codegen id : 1]
Input [7]: [shardId#893734, orderProposalId#893735L, items#893736, optimizationGroups#893737, isOptimal#893738, lastModified#893739, optimizationInsights#893740]
Condition : (isnotnull(shardId#893734) AND (shardId#893734 = 0_1_10000002109))
(5) Filter [codegen id : 1]
Input [2]: [isOptimal#893738, shardId#893734]
Condition : (isOptimal#893738 <=> false)
(6) Project [codegen id : 1]
Output [1]: [shardId#893734]
Input [2]: [isOptimal#893738, shardId#893734]
(7) HashAggregate [codegen id : 1]
Input [1]: [shardId#893734]
Keys [1]: [shardId#893734]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#893734]
(8) Exchange
Input [1]: [shardId#893734]
Arguments: hashpartitioning(shardId#893734, 20), ENSURE_REQUIREMENTS, [plan_id=349100]
(9) HashAggregate [codegen id : 2]
Input [1]: [shardId#893734]
Keys [1]: [shardId#893734]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#893734]