digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n3 ms (0 ms, 0 ms, 3 ms (stage 1033955.0: task 2668635))";
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>3 ms (0 ms, 0 ms, 3 ms (stage 1033955.0: task 2668635))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1033955.0: task 2668637))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#10214802], 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: 1104.0 B<br>merged fetch fallback count: 0<br>local blocks read: 12<br>remote merged chunks fetched: 0<br>remote blocks read: 18<br>data size total (min, med, max (stageId: taskId))<br>960.0 B (32.0 B, 32.0 B, 32.0 B (stage 1033954.0: task 2668617))<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 1033954.0: task 2668607))<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: 1656.0 B<br>number of partitions: 30<br>remote reqs duration: 7 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 1033954.0: task 2668617))" tooltip="Exchange hashpartitioning(shardId#10214802, 30), ENSURE_REQUIREMENTS, [plan_id=3020028]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n459 ms (1 ms, 17 ms, 29 ms (stage 1033954.0: task 2668606))";
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>248 ms (0 ms, 11 ms, 15 ms (stage 1033954.0: task 2668624))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1033954.0: task 2668617))<br>number of output rows: 30<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#10214802], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#10214802]"];
6 [id="node6" labelType="html" label="<b>Generate</b><br><br>number of output rows: 119,954" tooltip="Generate explode(items#10214804), [shardId#10214802], false, [item#10215313]"];
7 [id="node7" labelType="html" label="<b>Filter</b><br><br>number of output rows: 2,354" tooltip="Filter ((size(items#10214804, true) > 0) AND isnotnull(items#10214804))"];
}
8 [id="node8" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 2,354" tooltip="InMemoryTableScan [shardId#10214802, items#10214804], [(size(items#10214804, true) > 0), isnotnull(items#10214804)]"];
subgraph cluster9 {
isCluster="true";
id="cluster9";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
10 [id="node10" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#10214802) AND (shardId#10214802 = 0_3_10000000540))"];
}
11 [id="node11" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, optimizationInsights#10214808], [isnotnull(shardId#10214802), (shardId#10214802 = 0_3_10000000540)]"];
subgraph cluster12 {
isCluster="true";
id="cluster12";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
13 [id="node13" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#10214802) AND (shardId#10214802 = 0_3_10000000540))"];
14 [id="node14" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#10214802,orderProposalId#10214803L,items#10214804,optimizationGroups#10214805,isOptimal#10214806,lastModified#10214807,optimizationInsights#10214808]"];
}
2->1;
4->2;
5->4;
6->5;
7->6;
8->7;
10->8;
11->10;
13->11;
14->13;
}
== Physical Plan ==
* HashAggregate (13)
+- Exchange (12)
+- * HashAggregate (11)
+- * Project (10)
+- * Generate (9)
+- * Filter (8)
+- InMemoryTableScan (1)
+- InMemoryRelation (2)
+- * Filter (7)
+- InMemoryTableScan (3)
+- InMemoryRelation (4)
+- * Filter (6)
+- * Scan ExistingRDD (5)
(1) InMemoryTableScan
Output [2]: [shardId#10214802, items#10214804]
Arguments: [shardId#10214802, items#10214804], [(size(items#10214804, true) > 0), isnotnull(items#10214804)]
(2) InMemoryRelation
Arguments: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, optimizationInsights#10214808], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, optimizationInsights#10214808]
Arguments: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, optimizationInsights#10214808], [isnotnull(shardId#10214802), (shardId#10214802 = 0_3_10000000540)]
(4) InMemoryRelation
Arguments: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, lastModified#10214807, optimizationInsights#10214808], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, lastModified#10214807, optimizationInsights#10214808]
Arguments: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, lastModified#10214807, optimizationInsights#10214808], MapPartitionsRDD[434374] at start at FileStorageAdapterImpl.java:596, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, lastModified#10214807, optimizationInsights#10214808]
Condition : (isnotnull(shardId#10214802) AND (shardId#10214802 = 0_3_10000000540))
(7) Filter [codegen id : 1]
Input [6]: [shardId#10214802, orderProposalId#10214803L, items#10214804, optimizationGroups#10214805, isOptimal#10214806, optimizationInsights#10214808]
Condition : (isnotnull(shardId#10214802) AND (shardId#10214802 = 0_3_10000000540))
(8) Filter [codegen id : 1]
Input [2]: [shardId#10214802, items#10214804]
Condition : ((size(items#10214804, true) > 0) AND isnotnull(items#10214804))
(9) Generate [codegen id : 1]
Input [2]: [shardId#10214802, items#10214804]
Arguments: explode(items#10214804), [shardId#10214802], false, [item#10215313]
(10) Project [codegen id : 1]
Output [1]: [shardId#10214802]
Input [2]: [shardId#10214802, item#10215313]
(11) HashAggregate [codegen id : 1]
Input [1]: [shardId#10214802]
Keys [1]: [shardId#10214802]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#10214802]
(12) Exchange
Input [1]: [shardId#10214802]
Arguments: hashpartitioning(shardId#10214802, 30), ENSURE_REQUIREMENTS, [plan_id=3020028]
(13) HashAggregate [codegen id : 2]
Input [1]: [shardId#10214802]
Keys [1]: [shardId#10214802]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#10214802]