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 66626.0: task 166355))"; 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 66626.0: task 166355))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 66626.0: task 166355))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#803008], functions=[])"]; } 2 [id="node2" 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(shardId#803008, 20), ENSURE_REQUIREMENTS, [plan_id=315621]"]; subgraph cluster3 { isCluster="true"; id="cluster3"; label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n73 ms (0 ms, 7 ms, 7 ms (stage 66625.0: task 166334))"; 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>13 ms (0 ms, 1 ms, 2 ms (stage 66625.0: task 166330))<br>peak memory total (min, med, max (stageId: taskId))<br>5.0 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 66625.0: task 166334))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#803008], functions=[])"]; 5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#803008]"]; 6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isOptimal#803012 <=> false)"]; } 7 [id="node7" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [isOptimal#803012, shardId#803008], [(isOptimal#803012 <=> false)]"]; subgraph cluster8 { isCluster="true"; id="cluster8"; label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n363 ms (14 ms, 18 ms, 24 ms (stage 66625.0: task 166332))"; tooltip="WholeStageCodegen (1)"; 9 [id="node9" labelType="html" label="<b>Filter</b><br><br>number of output rows: 59" tooltip="Filter (isnotnull(shardId#803008) AND (shardId#803008 = 0_1_10000002108))"]; 10 [id="node10" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 59" tooltip="Scan ExistingRDD[shardId#803008,orderProposalId#803009L,items#803010,optimizationGroups#803011,isOptimal#803012,lastModified#803013,optimizationInsights#803014]"]; } 2->1; 4->2; 5->4; 6->5; 7->6; 9->7; 10->9; }