digraph G {
0 [id="node0" labelType="html" label="<b>CollectLimit</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>local merged bytes read: 0.0 B<br>remote reqs duration: 0 ms<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>remote bytes read to disk: 0.0 B<br>shuffle bytes written: 0.0 B" tooltip="CollectLimit 1"];
subgraph cluster1 {
isCluster="true";
id="cluster1";
label="WholeStageCodegen (5)\n \nduration: total (min, med, max (stageId: taskId))\n97 ms (0 ms, 9 ms, 10 ms (stage 60504.0: task 149287))";
tooltip="WholeStageCodegen (5)";
2 [id="node2" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project"];
3 [id="node3" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter insight#716813.internalInsightType IN (OP_CALC_ITEM_ACCEPT_THR_NOT_MET,OP_CALC_ITEM_NEGL_THR_NOT_MET,OP_CALC_ITEM_OPT_MISSING_MD,OP_CALC_LOCKED_QUANTITY_PREVENTS_DISCARDING_INSIGHT,OP_CALC_MIN_NOT_MET)"];
4 [id="node4" labelType="html" label="<b>Generate</b><br><br>number of output rows: 0" tooltip="Generate explode(optimizationInsights#712669), false, [insight#716813]"];
5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [optimizationInsights#712669]"];
6 [id="node6" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [orderProposalId#712664L], [orderProposalId#713376L], Inner, BuildLeft, false"];
17 [id="node17" 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>4 ms (0 ms, 0 ms, 1 ms (stage 60504.0: task 149293))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 60504.0: task 149287))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#713376L], functions=[])"];
}
7 [id="node7" labelType="html" label="<b>BroadcastExchange</b><br><br>time to broadcast: 0 ms<br>time to build: 4 ms<br>time to collect: 100 ms<br>number of output rows: 6<br>data size: 1024.3 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, false]),false), [plan_id=284570]"];
subgraph cluster8 {
isCluster="true";
id="cluster8";
label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n17 ms (0 ms, 1 ms, 2 ms (stage 60500.0: task 149200))";
tooltip="WholeStageCodegen (1)";
9 [id="node9" labelType="html" label="<b>Filter</b><br><br>number of output rows: 6" tooltip="Filter ((isnotnull(orderProposalId#712664L) AND (size(optimizationInsights#712669, true) > 0)) AND isnotnull(optimizationInsights#712669))"];
}
10 [id="node10" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 14" tooltip="InMemoryTableScan [orderProposalId#712664L, optimizationInsights#712669], [isnotnull(orderProposalId#712664L), (size(optimizationInsights#712669, true) > 0), isnotnull(optimizationInsights#712669)]"];
subgraph cluster11 {
isCluster="true";
id="cluster11";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
12 [id="node12" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#712663) AND (shardId#712663 = 0_1_10000002107))"];
}
13 [id="node13" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, optimizationInsights#712669], [isnotnull(shardId#712663), (shardId#712663 = 0_1_10000002107)]"];
subgraph cluster14 {
isCluster="true";
id="cluster14";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
15 [id="node15" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#712663) AND (shardId#712663 = 0_1_10000002107))"];
16 [id="node16" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#712663,orderProposalId#712664L,items#712665,optimizationGroups#712666,isOptimal#712667,lastModified#712668,optimizationInsights#712669]"];
}
18 [id="node18" 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(orderProposalId#713376L, 20), ENSURE_REQUIREMENTS, [plan_id=284592]"];
subgraph cluster19 {
isCluster="true";
id="cluster19";
label="WholeStageCodegen (4)\n \nduration: total (min, med, max (stageId: taskId))\n30 ms (0 ms, 3 ms, 3 ms (stage 60503.0: task 149265))";
tooltip="WholeStageCodegen (4)";
20 [id="node20" 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 60503.0: task 149265))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 60503.0: task 149265))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[orderProposalId#713376L], functions=[])"];
21 [id="node21" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#713376L]"];
22 [id="node22" labelType="html" label="<b>BroadcastHashJoin</b><br><br>number of output rows: 0" tooltip="BroadcastHashJoin [worklistShardItemId#713175L], [worklistShardItemId#713399L], Inner, BuildLeft, false"];
36 [id="node36" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [worklistShardItemId#713399L, orderProposalId#713376L]"];
}
23 [id="node23" labelType="html" label="<b>BroadcastExchange</b><br><br>time to broadcast: 0 ms<br>time to build: 0 ms<br>time to collect: 105 ms<br>number of output rows: 205<br>data size: 1032.0 KiB" tooltip="BroadcastExchange HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=284578]"];
subgraph cluster24 {
isCluster="true";
id="cluster24";
label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n0 ms (0 ms, 0 ms, 0 ms (stage 60501.0: task 149209))";
tooltip="WholeStageCodegen (2)";
25 [id="node25" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [item#713174L AS worklistShardItemId#713175L]"];
26 [id="node26" labelType="html" label="<b>Generate</b><br><br>number of output rows: 205" tooltip="Generate explode(_extract_worklistShardItemId#720225), false, [item#713174L]"];
27 [id="node27" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [items#716807.worklistShardItemId AS _extract_worklistShardItemId#720225]"];
28 [id="node28" labelType="html" label="<b>Filter</b><br><br>number of output rows: 14" tooltip="Filter (((size(items#716807.worklistShardItemId, true) > 0) AND isnotnull(items#716807.worklistShardItemId)) AND (shardId#716805 = 0_1_10000002107))"];
}
29 [id="node29" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 14" tooltip="InMemoryTableScan [items#716807, shardId#716805], [(size(items#716807.worklistShardItemId, true) > 0), isnotnull(items#716807.worklistShardItemId), (shardId#716805 = 0_1_10000002107)]"];
subgraph cluster30 {
isCluster="true";
id="cluster30";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
31 [id="node31" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#712663) AND (shardId#712663 = 0_1_10000002107))"];
}
32 [id="node32" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, optimizationInsights#712669], [isnotnull(shardId#712663), (shardId#712663 = 0_1_10000002107)]"];
subgraph cluster33 {
isCluster="true";
id="cluster33";
label="WholeStageCodegen (1)\n \nduration: 0 ms";
tooltip="WholeStageCodegen (1)";
34 [id="node34" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#712663) AND (shardId#712663 = 0_1_10000002107))"];
35 [id="node35" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 0" tooltip="Scan ExistingRDD[shardId#712663,orderProposalId#712664L,items#712665,optimizationGroups#712666,isOptimal#712667,lastModified#712668,optimizationInsights#712669]"];
}
37 [id="node37" 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(worklistShardItemId#713399L, 20), REPARTITION_BY_NUM, [plan_id=284585]"];
subgraph cluster38 {
isCluster="true";
id="cluster38";
label="WholeStageCodegen (3)\n \nduration: total (min, med, max (stageId: taskId))\n2.0 s (51 ms, 71 ms, 134 ms (stage 60502.0: task 149242))";
tooltip="WholeStageCodegen (3)";
39 [id="node39" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [orderProposalId#713376L, worklistShardItemId#713399L]"];
40 [id="node40" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter ((isnotnull(worklistShardItemId#713399L) AND NOT (isFallbackOrderOnly#713393 <=> true)) AND isnotnull(orderProposalId#713376L))"];
41 [id="node41" labelType="html" label="<b>ColumnarToRow</b><br><br>number of output rows: 0<br>number of input batches: 0" tooltip="ColumnarToRow"];
}
42 [id="node42" labelType="html" label="<b>Scan parquet </b><br><br>number of files read: 25<br>scan time total (min, med, max (stageId: taskId))<br>2.0 s (51 ms, 71 ms, 134 ms (stage 60502.0: task 149242))<br>dynamic partition pruning time: 0 ms<br>metadata time: 0 ms<br>size of files read: 520.6 KiB<br>number of output rows: 0<br>number of partitions read: 1" tooltip="FileScan parquet [orderProposalId#713376L,isFallbackOrderOnly#713393,worklistShardItemId#713399L,shardId#713420,sequenceId#713398] Batched: true, DataFilters: [isnotnull(worklistShardItemId#713399L), NOT (isFallbackOrderOnly#713393 <=> true), isnotnull(ord..., Format: Parquet, Location: PreparedDeltaFileIndex(1 paths)[hdlfs://2e93940d-4be8-4f12-830d-f0b8d392c03a.files.hdl.prod-eu20...., PartitionFilters: [isnotnull(shardId#713420), isnotnull(sequenceId#713398), (shardId#713420 = 0_1_10000002107), (se..., PushedFilters: [IsNotNull(worklistShardItemId), Not(EqualNullSafe(isFallbackOrderOnly,true)), IsNotNull(orderPro..., ReadSchema: struct<orderProposalId:bigint,isFallbackOrderOnly:boolean,worklistShardItemId:bigint>"];
2->0;
3->2;
4->3;
5->4;
6->5;
7->6;
9->7;
10->9;
12->10;
13->12;
15->13;
16->15;
17->6;
18->17;
20->18;
21->20;
22->21;
23->22;
25->23;
26->25;
27->26;
28->27;
29->28;
31->29;
32->31;
34->32;
35->34;
36->22;
37->36;
39->37;
40->39;
41->40;
42->41;
}
== Physical Plan ==
CollectLimit (33)
+- * Project (32)
+- * Filter (31)
+- * Generate (30)
+- * Project (29)
+- * BroadcastHashJoin Inner BuildLeft (28)
:- BroadcastExchange (9)
: +- * Filter (8)
: +- InMemoryTableScan (1)
: +- InMemoryRelation (2)
: +- * Filter (7)
: +- InMemoryTableScan (3)
: +- InMemoryRelation (4)
: +- * Filter (6)
: +- * Scan ExistingRDD (5)
+- * HashAggregate (27)
+- Exchange (26)
+- * HashAggregate (25)
+- * Project (24)
+- * BroadcastHashJoin Inner BuildLeft (23)
:- BroadcastExchange (16)
: +- * Project (15)
: +- * Generate (14)
: +- * Project (13)
: +- * Filter (12)
: +- InMemoryTableScan (10)
: +- InMemoryRelation (11)
: +- * Filter (7)
: +- InMemoryTableScan (3)
: +- InMemoryRelation (4)
: +- * Filter (6)
: +- * Scan ExistingRDD (5)
+- * Project (22)
+- Exchange (21)
+- * Project (20)
+- * Filter (19)
+- * ColumnarToRow (18)
+- Scan parquet (17)
(1) InMemoryTableScan
Output [2]: [orderProposalId#712664L, optimizationInsights#712669]
Arguments: [orderProposalId#712664L, optimizationInsights#712669], [isnotnull(orderProposalId#712664L), (size(optimizationInsights#712669, true) > 0), isnotnull(optimizationInsights#712669)]
(2) InMemoryRelation
Arguments: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, optimizationInsights#712669], StorageLevel(disk, memory, 2 replicas)
(3) InMemoryTableScan
Output [6]: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, optimizationInsights#712669]
Arguments: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, optimizationInsights#712669], [isnotnull(shardId#712663), (shardId#712663 = 0_1_10000002107)]
(4) InMemoryRelation
Arguments: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, lastModified#712668, optimizationInsights#712669], StorageLevel(disk, memory, 2 replicas)
(5) Scan ExistingRDD [codegen id : 1]
Output [7]: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, lastModified#712668, optimizationInsights#712669]
Arguments: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, lastModified#712668, optimizationInsights#712669], MapPartitionsRDD[33617] at start at FileStorageAdapterImpl.java:592, ExistingRDD, UnknownPartitioning(0)
(6) Filter [codegen id : 1]
Input [7]: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, lastModified#712668, optimizationInsights#712669]
Condition : (isnotnull(shardId#712663) AND (shardId#712663 = 0_1_10000002107))
(7) Filter [codegen id : 1]
Input [6]: [shardId#712663, orderProposalId#712664L, items#712665, optimizationGroups#712666, isOptimal#712667, optimizationInsights#712669]
Condition : (isnotnull(shardId#712663) AND (shardId#712663 = 0_1_10000002107))
(8) Filter [codegen id : 1]
Input [2]: [orderProposalId#712664L, optimizationInsights#712669]
Condition : ((isnotnull(orderProposalId#712664L) AND (size(optimizationInsights#712669, true) > 0)) AND isnotnull(optimizationInsights#712669))
(9) BroadcastExchange
Input [2]: [orderProposalId#712664L, optimizationInsights#712669]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, false]),false), [plan_id=284570]
(10) InMemoryTableScan
Output [2]: [items#716807, shardId#716805]
Arguments: [items#716807, shardId#716805], [(size(items#716807.worklistShardItemId, true) > 0), isnotnull(items#716807.worklistShardItemId), (shardId#716805 = 0_1_10000002107)]
(11) InMemoryRelation
Arguments: [shardId#716805, orderProposalId#716806L, items#716807, optimizationGroups#716808, isOptimal#716809, optimizationInsights#716811], StorageLevel(disk, memory, 2 replicas)
(12) Filter [codegen id : 2]
Input [2]: [items#716807, shardId#716805]
Condition : (((size(items#716807.worklistShardItemId, true) > 0) AND isnotnull(items#716807.worklistShardItemId)) AND (shardId#716805 = 0_1_10000002107))
(13) Project [codegen id : 2]
Output [1]: [items#716807.worklistShardItemId AS _extract_worklistShardItemId#720225]
Input [2]: [items#716807, shardId#716805]
(14) Generate [codegen id : 2]
Input [1]: [_extract_worklistShardItemId#720225]
Arguments: explode(_extract_worklistShardItemId#720225), false, [item#713174L]
(15) Project [codegen id : 2]
Output [1]: [item#713174L AS worklistShardItemId#713175L]
Input [1]: [item#713174L]
(16) BroadcastExchange
Input [1]: [worklistShardItemId#713175L]
Arguments: HashedRelationBroadcastMode(List(input[0, bigint, true]),false), [plan_id=284578]
(17) Scan parquet
Output [5]: [orderProposalId#713376L, isFallbackOrderOnly#713393, worklistShardItemId#713399L, shardId#713420, sequenceId#713398]
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/10000002107]
PartitionFilters: [isnotnull(shardId#713420), isnotnull(sequenceId#713398), (shardId#713420 = 0_1_10000002107), (sequenceId#713398 = 6)]
PushedFilters: [IsNotNull(worklistShardItemId), Not(EqualNullSafe(isFallbackOrderOnly,true)), IsNotNull(orderProposalId)]
ReadSchema: struct<orderProposalId:bigint,isFallbackOrderOnly:boolean,worklistShardItemId:bigint>
(18) ColumnarToRow [codegen id : 3]
Input [5]: [orderProposalId#713376L, isFallbackOrderOnly#713393, worklistShardItemId#713399L, shardId#713420, sequenceId#713398]
(19) Filter [codegen id : 3]
Input [5]: [orderProposalId#713376L, isFallbackOrderOnly#713393, worklistShardItemId#713399L, shardId#713420, sequenceId#713398]
Condition : ((isnotnull(worklistShardItemId#713399L) AND NOT (isFallbackOrderOnly#713393 <=> true)) AND isnotnull(orderProposalId#713376L))
(20) Project [codegen id : 3]
Output [2]: [orderProposalId#713376L, worklistShardItemId#713399L]
Input [5]: [orderProposalId#713376L, isFallbackOrderOnly#713393, worklistShardItemId#713399L, shardId#713420, sequenceId#713398]
(21) Exchange
Input [2]: [orderProposalId#713376L, worklistShardItemId#713399L]
Arguments: hashpartitioning(worklistShardItemId#713399L, 20), REPARTITION_BY_NUM, [plan_id=284585]
(22) Project
Output [2]: [worklistShardItemId#713399L, orderProposalId#713376L]
Input [2]: [orderProposalId#713376L, worklistShardItemId#713399L]
(23) BroadcastHashJoin [codegen id : 4]
Left keys [1]: [worklistShardItemId#713175L]
Right keys [1]: [worklistShardItemId#713399L]
Join type: Inner
Join condition: None
(24) Project [codegen id : 4]
Output [1]: [orderProposalId#713376L]
Input [3]: [worklistShardItemId#713175L, worklistShardItemId#713399L, orderProposalId#713376L]
(25) HashAggregate [codegen id : 4]
Input [1]: [orderProposalId#713376L]
Keys [1]: [orderProposalId#713376L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#713376L]
(26) Exchange
Input [1]: [orderProposalId#713376L]
Arguments: hashpartitioning(orderProposalId#713376L, 20), ENSURE_REQUIREMENTS, [plan_id=284592]
(27) HashAggregate
Input [1]: [orderProposalId#713376L]
Keys [1]: [orderProposalId#713376L]
Functions: []
Aggregate Attributes: []
Results [1]: [orderProposalId#713376L]
(28) BroadcastHashJoin [codegen id : 5]
Left keys [1]: [orderProposalId#712664L]
Right keys [1]: [orderProposalId#713376L]
Join type: Inner
Join condition: None
(29) Project [codegen id : 5]
Output [1]: [optimizationInsights#712669]
Input [3]: [orderProposalId#712664L, optimizationInsights#712669, orderProposalId#713376L]
(30) Generate [codegen id : 5]
Input [1]: [optimizationInsights#712669]
Arguments: explode(optimizationInsights#712669), false, [insight#716813]
(31) Filter [codegen id : 5]
Input [1]: [insight#716813]
Condition : insight#716813.internalInsightType IN (OP_CALC_ITEM_ACCEPT_THR_NOT_MET,OP_CALC_ITEM_NEGL_THR_NOT_MET,OP_CALC_ITEM_OPT_MISSING_MD,OP_CALC_LOCKED_QUANTITY_PREVENTS_DISCARDING_INSIGHT,OP_CALC_MIN_NOT_MET)
(32) Project [codegen id : 5]
Output: []
Input [1]: [insight#716813]
(33) CollectLimit
Input: []
Arguments: 1