digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n1 ms (0 ms, 0 ms, 1 ms (stage 82308.0: task 199414))";
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 82308.0: task 199419))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 82308.0: task 199419))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#981205], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 4<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 4<br>local bytes read: 276.0 B<br>merged fetch fallback count: 0<br>local blocks read: 3<br>remote merged chunks fetched: 0<br>remote blocks read: 1<br>data size total (min, med, max (stageId: taskId))<br>128.0 B (32.0 B, 32.0 B, 32.0 B (stage 82307.0: task 199403))<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>1 ms (0 ms, 0 ms, 0 ms (stage 82307.0: task 199403))<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: 92.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>368.0 B (92.0 B, 92.0 B, 92.0 B (stage 82307.0: task 199403))" tooltip="Exchange hashpartitioning(shardId#981205, 20), ENSURE_REQUIREMENTS, [plan_id=381559]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n77 ms (0 ms, 7 ms, 8 ms (stage 82307.0: task 199403))";
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>12 ms (0 ms, 0 ms, 2 ms (stage 82307.0: task 199403))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 82307.0: task 199398))<br>number of output rows: 4<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#981205], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#981205]"];
6 [id="node6" labelType="html" label="<b>Generate</b><br><br>number of output rows: 8" tooltip="Generate explode(items#981207), [shardId#981205], false, [item#981716]"];
7 [id="node7" labelType="html" label="<b>Filter</b><br><br>number of output rows: 5" tooltip="Filter ((size(items#981207, true) > 0) AND isnotnull(items#981207))"];
}
8 [id="node8" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 5" tooltip="InMemoryTableScan [shardId#981205, items#981207], [(size(items#981207, true) > 0), isnotnull(items#981207)]"];
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#981205) AND (shardId#981205 = 0_1_10000002110))"];
}
11 [id="node11" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211], [isnotnull(shardId#981205), (shardId#981205 = 0_1_10000002110)]"];
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#981205) AND (shardId#981205 = 0_1_10000002110))"];
14 [id="node14" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#981205,orderProposalId#981206L,items#981207,optimizationGroups#981208,isOptimal#981209,lastModified#981210,optimizationInsights#981211]"];
}
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#981205, items#981207]
Arguments: [shardId#981205, items#981207], [(size(items#981207, true) > 0), isnotnull(items#981207)]
(2) InMemoryRelation
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211]
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211], [isnotnull(shardId#981205), (shardId#981205 = 0_1_10000002110)]
(4) InMemoryRelation
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211]
Arguments: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211], MapPartitionsRDD[46018] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, lastModified#981210, optimizationInsights#981211]
Condition : (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))
(7) Filter [codegen id : 1]
Input [6]: [shardId#981205, orderProposalId#981206L, items#981207, optimizationGroups#981208, isOptimal#981209, optimizationInsights#981211]
Condition : (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))
(8) Filter [codegen id : 1]
Input [2]: [shardId#981205, items#981207]
Condition : ((size(items#981207, true) > 0) AND isnotnull(items#981207))
(9) Generate [codegen id : 1]
Input [2]: [shardId#981205, items#981207]
Arguments: explode(items#981207), [shardId#981205], false, [item#981716]
(10) Project [codegen id : 1]
Output [1]: [shardId#981205]
Input [2]: [shardId#981205, item#981716]
(11) HashAggregate [codegen id : 1]
Input [1]: [shardId#981205]
Keys [1]: [shardId#981205]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#981205]
(12) Exchange
Input [1]: [shardId#981205]
Arguments: hashpartitioning(shardId#981205, 20), ENSURE_REQUIREMENTS, [plan_id=381559]
(13) HashAggregate [codegen id : 2]
Input [1]: [shardId#981205]
Keys [1]: [shardId#981205]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#981205]