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 1311330.0: task 2445488))";
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 1311330.0: task 2445488))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1311330.0: task 2445488))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#5499000], functions=[])"];
}
2 [id="node2" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 1<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 1<br>local bytes read: 92.0 B<br>merged fetch fallback count: 0<br>local blocks read: 1<br>remote merged chunks fetched: 0<br>remote blocks read: 0<br>data size: 32.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: 92.0 B" tooltip="Exchange hashpartitioning(shardId#5499000, 30), ENSURE_REQUIREMENTS, [plan_id=2853510]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n2 ms (0 ms, 0 ms, 2 ms (stage 1311329.0: task 2445460))";
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>1 ms (0 ms, 0 ms, 1 ms (stage 1311329.0: task 2445460))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 1311329.0: task 2445452))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#5499000], functions=[])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#5499000]"];
6 [id="node6" labelType="html" label="<b>Generate</b><br><br>number of output rows: 29" tooltip="Generate explode(items#5499002), [shardId#5499000], false, [item#5499511]"];
7 [id="node7" labelType="html" label="<b>Filter</b><br><br>number of output rows: 2" tooltip="Filter ((size(items#5499002, true) > 0) AND isnotnull(items#5499002))"];
}
8 [id="node8" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 2" tooltip="InMemoryTableScan [shardId#5499000, items#5499002], [(size(items#5499002, true) > 0), isnotnull(items#5499002)]"];
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#5499000) AND (shardId#5499000 = 0_1_10000001445))"];
}
11 [id="node11" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006], [isnotnull(shardId#5499000), (shardId#5499000 = 0_1_10000001445)]"];
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#5499000) AND (shardId#5499000 = 0_1_10000001445))"];
14 [id="node14" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#5499000,orderProposalId#5499001L,items#5499002,optimizationGroups#5499003,isOptimal#5499004,lastModified#5499005,optimizationInsights#5499006]"];
}
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#5499000, items#5499002]
Arguments: [shardId#5499000, items#5499002], [(size(items#5499002, true) > 0), isnotnull(items#5499002)]
(2) InMemoryRelation
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006]
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006], [isnotnull(shardId#5499000), (shardId#5499000 = 0_1_10000001445)]
(4) InMemoryRelation
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006]
Arguments: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006], MapPartitionsRDD[387429] at start at FileStorageAdapterImpl.java:598, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, lastModified#5499005, optimizationInsights#5499006]
Condition : (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))
(7) Filter [codegen id : 1]
Input [6]: [shardId#5499000, orderProposalId#5499001L, items#5499002, optimizationGroups#5499003, isOptimal#5499004, optimizationInsights#5499006]
Condition : (isnotnull(shardId#5499000) AND (shardId#5499000 = 0_1_10000001445))
(8) Filter [codegen id : 1]
Input [2]: [shardId#5499000, items#5499002]
Condition : ((size(items#5499002, true) > 0) AND isnotnull(items#5499002))
(9) Generate [codegen id : 1]
Input [2]: [shardId#5499000, items#5499002]
Arguments: explode(items#5499002), [shardId#5499000], false, [item#5499511]
(10) Project [codegen id : 1]
Output [1]: [shardId#5499000]
Input [2]: [shardId#5499000, item#5499511]
(11) HashAggregate [codegen id : 1]
Input [1]: [shardId#5499000]
Keys [1]: [shardId#5499000]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#5499000]
(12) Exchange
Input [1]: [shardId#5499000]
Arguments: hashpartitioning(shardId#5499000, 30), ENSURE_REQUIREMENTS, [plan_id=2853510]
(13) HashAggregate [codegen id : 2]
Input [1]: [shardId#5499000]
Keys [1]: [shardId#5499000]
Functions: []
Aggregate Attributes: []
Results [1]: [shardId#5499000]