digraph G {
subgraph cluster0 {
isCluster="true";
id="cluster0";
label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n21 ms (0 ms, 2 ms, 3 ms (stage 83758.0: task 201064))";
tooltip="WholeStageCodegen (4)";
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, 2 ms (stage 83758.0: task 201064))<br>peak memory total (min, med, max (stageId: taskId))<br>7.0 MiB (256.0 KiB, 256.0 KiB, 2.3 MiB (stage 83758.0: task 201064))<br>number of output rows: 1<br>number of sort fallback tasks: 0<br>avg hash probes per key: 1" tooltip="HashAggregate(keys=[shardId#981205], functions=[sum(CASE WHEN NOT (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END), sum(CASE WHEN (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)])"];
}
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: 297.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>192.0 B (48.0 B, 48.0 B, 48.0 B (stage 83757.0: task 201045))<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 83757.0: task 201054))<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: 99.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>396.0 B (99.0 B, 99.0 B, 99.0 B (stage 83757.0: task 201045))" tooltip="Exchange hashpartitioning(shardId#981205, 20), ENSURE_REQUIREMENTS, [plan_id=383681]"];
subgraph cluster3 {
isCluster="true";
id="cluster3";
label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n527 ms (0 ms, 52 ms, 52 ms (stage 83757.0: task 201051))";
tooltip="WholeStageCodegen (3)";
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>11 ms (0 ms, 0 ms, 2 ms (stage 83757.0: task 201047))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 83757.0: task 201051))<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=[partial_sum(CASE WHEN NOT (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END), partial_sum(CASE WHEN (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)])"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#981205, isFallbackOrderOnly#981935]"];
6 [id="node6" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 8" tooltip="BroadcastHashJoin [worklistShardItemId#981717L], [worklistShardItemId#981941L], LeftOuter, BuildRight, (shardId#981205 = 0_1_10000002110), false"];
7 [id="node7" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#981205, item#981716L AS worklistShardItemId#981717L]"];
8 [id="node8" labelType="html" label="<b>Generate</b><br><br>number of output rows: 8" tooltip="Generate explode(_extract_worklistShardItemId#992190), [shardId#981205], false, [item#981716L]"];
9 [id="node9" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#981205, items#981207.worklistShardItemId AS _extract_worklistShardItemId#992190]"];
10 [id="node10" labelType="html" label="<b>Filter</b><br><br>number of output rows: 5" tooltip="Filter ((size(items#981207.worklistShardItemId, true) > 0) AND isnotnull(items#981207.worklistShardItemId))"];
}
11 [id="node11" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 5" tooltip="InMemoryTableScan [items#981207, shardId#981205], [(size(items#981207.worklistShardItemId, true) > 0), isnotnull(items#981207.worklistShardItemId)]"];
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>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 cluster15 {
isCluster="true";
id="cluster15";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
16 [id="node16" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#981205) AND (shardId#981205 = 0_1_10000002110))"];
17 [id="node17" 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]"];
}
18 [id="node18" labelType="html" label="<b>BroadcastExchange</b><br><br>time to broadcast: 0 ms<br>time to build: 1 ms<br>time to collect: 221 ms<br>number of output rows: 8<br>data size: 1024.2 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=383675]"];
subgraph cluster19 {
isCluster="true";
id="cluster19";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n3 ms (0 ms, 0 ms, 1 ms (stage 83671.0: task 201025))";
tooltip="WholeStageCodegen (2)";
20 [id="node20" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [worklistShardItemId#981941L, isFallbackOrderOnly#981935]"];
}
21 [id="node21" labelType="html" label="<b>Exchange</b><br><br>shuffle records written: 8<br>remote merged reqs duration: 0 ms<br>remote merged blocks fetched: 0<br>records read: 8<br>local bytes read total (min, med, max (stageId: taskId))<br>600.0 B (75.0 B, 75.0 B, 150.0 B (stage 83671.0: task 201025))<br>merged fetch fallback count: 0<br>local blocks read: 8<br>remote merged chunks fetched: 0<br>remote blocks read: 0<br>data size total (min, med, max (stageId: taskId))<br>192.0 B (24.0 B, 24.0 B, 48.0 B (stage 83670.0: task 201019))<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>2 ms (0 ms, 0 ms, 0 ms (stage 83670.0: task 201021))<br>remote merged bytes read: 0.0 B<br>local merged blocks fetched: 0<br>corrupt merged block chunks: 0<br>fetch wait time total (min, med, max (stageId: taskId))<br>0 ms (0 ms, 0 ms, 0 ms (stage 83671.0: task 201024))<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 total (min, med, max (stageId: taskId))<br>600.0 B (75.0 B, 75.0 B, 150.0 B (stage 83670.0: task 201019))" tooltip="Exchange hashpartitioning(worklistShardItemId#981941L, 20), REPARTITION_BY_NUM, [plan_id=383671]"];
subgraph cluster22 {
isCluster="true";
id="cluster22";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n611 ms (90 ms, 103 ms, 121 ms (stage 83670.0: task 201023))";
tooltip="WholeStageCodegen (1)";
23 [id="node23" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [isFallbackOrderOnly#981935, worklistShardItemId#981941L]"];
24 [id="node24" labelType="html" label="<b>Filter</b><br><br>number of output rows: 8" tooltip="Filter isnotnull(worklistShardItemId#981941L)"];
25 [id="node25" labelType="html" label="<b>ColumnarToRow</b><br><br>number of output rows: 8<br>number of input batches: 6" tooltip="ColumnarToRow"];
}
26 [id="node26" labelType="html" label="<b>Scan parquet </b><br><br>number of files read: 6<br>scan time total (min, med, max (stageId: taskId))<br>595 ms (87 ms, 100 ms, 118 ms (stage 83670.0: task 201023))<br>dynamic partition pruning time: 0 ms<br>metadata time: 0 ms<br>size of files read: 113.9 KiB<br>number of output rows: 8<br>number of partitions read: 1" tooltip="FileScan parquet [isFallbackOrderOnly#981935,worklistShardItemId#981941L,shardId#981962,sequenceId#981940] Batched: true, DataFilters: [isnotnull(worklistShardItemId#981941L)], Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#981962), isnotnull(sequenceId#981940), (shardId#981962 = 0_1_10000002110), (se..., PushedFilters: [IsNotNull(worklistShardItemId)], ReadSchema: struct<isFallbackOrderOnly:boolean,worklistShardItemId:bigint>"];
2->1;
4->2;
5->4;
6->5;
7->6;
8->7;
9->8;
10->9;
11->10;
13->11;
14->13;
16->14;
17->16;
18->6;
20->18;
21->20;
23->21;
24->23;
25->24;
26->25;
}
== Physical Plan ==
* HashAggregate (23)
+- Exchange (22)
+- * HashAggregate (21)
+- * Project (20)
+- * BroadcastHashJoin LeftOuter BuildRight (19)
:- * Project (11)
: +- * Generate (10)
: +- * Project (9)
: +- * Filter (8)
: +- InMemoryTableScan (1)
: +- InMemoryRelation (2)
: +- * Filter (7)
: +- InMemoryTableScan (3)
: +- InMemoryRelation (4)
: +- * Filter (6)
: +- * Scan ExistingRDD (5)
+- BroadcastExchange (18)
+- * Project (17)
+- Exchange (16)
+- * Project (15)
+- * Filter (14)
+- * ColumnarToRow (13)
+- Scan parquet (12)
(1) InMemoryTableScan
Output [2]: [items#981207, shardId#981205]
Arguments: [items#981207, shardId#981205], [(size(items#981207.worklistShardItemId, true) > 0), isnotnull(items#981207.worklistShardItemId)]
(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 : 3]
Input [2]: [items#981207, shardId#981205]
Condition : ((size(items#981207.worklistShardItemId, true) > 0) AND isnotnull(items#981207.worklistShardItemId))
(9) Project [codegen id : 3]
Output [2]: [shardId#981205, items#981207.worklistShardItemId AS _extract_worklistShardItemId#992190]
Input [2]: [items#981207, shardId#981205]
(10) Generate [codegen id : 3]
Input [2]: [shardId#981205, _extract_worklistShardItemId#992190]
Arguments: explode(_extract_worklistShardItemId#992190), [shardId#981205], false, [item#981716L]
(11) Project [codegen id : 3]
Output [2]: [shardId#981205, item#981716L AS worklistShardItemId#981717L]
Input [2]: [shardId#981205, item#981716L]
(12) Scan parquet
Output [4]: [isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]
Batched: true
Location: PreparedDeltaFileIndex [hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20.hanacloud.ondemand.com:443/crp-order-qty-opt-service/internal/prod-plant-snapshot/10000002110]
PartitionFilters: [isnotnull(shardId#981962), isnotnull(sequenceId#981940), (shardId#981962 = 0_1_10000002110), (sequenceId#981940 = 2)]
PushedFilters: [IsNotNull(worklistShardItemId)]
ReadSchema: struct<isFallbackOrderOnly:boolean,worklistShardItemId:bigint>
(13) ColumnarToRow [codegen id : 1]
Input [4]: [isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]
(14) Filter [codegen id : 1]
Input [4]: [isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]
Condition : isnotnull(worklistShardItemId#981941L)
(15) Project [codegen id : 1]
Output [2]: [isFallbackOrderOnly#981935, worklistShardItemId#981941L]
Input [4]: [isFallbackOrderOnly#981935, worklistShardItemId#981941L, shardId#981962, sequenceId#981940]
(16) Exchange
Input [2]: [isFallbackOrderOnly#981935, worklistShardItemId#981941L]
Arguments: hashpartitioning(worklistShardItemId#981941L, 20), REPARTITION_BY_NUM, [plan_id=383671]
(17) Project [codegen id : 2]
Output [2]: [worklistShardItemId#981941L, isFallbackOrderOnly#981935]
Input [2]: [isFallbackOrderOnly#981935, worklistShardItemId#981941L]
(18) BroadcastExchange
Input [2]: [worklistShardItemId#981941L, isFallbackOrderOnly#981935]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=383675]
(19) BroadcastHashJoin [codegen id : 3]
Left keys [1]: [worklistShardItemId#981717L]
Right keys [1]: [worklistShardItemId#981941L]
Join type: LeftOuter
Join condition: (shardId#981205 = 0_1_10000002110)
(20) Project [codegen id : 3]
Output [2]: [shardId#981205, isFallbackOrderOnly#981935]
Input [4]: [shardId#981205, worklistShardItemId#981717L, worklistShardItemId#981941L, isFallbackOrderOnly#981935]
(21) HashAggregate [codegen id : 3]
Input [2]: [shardId#981205, isFallbackOrderOnly#981935]
Keys [1]: [shardId#981205]
Functions [2]: [partial_sum(CASE WHEN NOT (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END), partial_sum(CASE WHEN (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)]
Aggregate Attributes [2]: [sum#992291L, sum#992292L]
Results [3]: [shardId#981205, sum#992293L, sum#992294L]
(22) Exchange
Input [3]: [shardId#981205, sum#992293L, sum#992294L]
Arguments: hashpartitioning(shardId#981205, 20), ENSURE_REQUIREMENTS, [plan_id=383681]
(23) HashAggregate [codegen id : 4]
Input [3]: [shardId#981205, sum#992293L, sum#992294L]
Keys [1]: [shardId#981205]
Functions [2]: [sum(CASE WHEN NOT (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END), sum(CASE WHEN (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)]
Aggregate Attributes [2]: [sum(CASE WHEN NOT (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)#992127L, sum(CASE WHEN (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)#992128L]
Results [3]: [shardId#981205, sum(CASE WHEN NOT (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)#992127L AS operativeCount#992086L, sum(CASE WHEN (isFallbackOrderOnly#981935 <=> true) THEN 1 ELSE 0 END)#992128L AS fallbackCount#992087L]