digraph G { subgraph cluster0 { isCluster="true"; id="cluster0"; label="WholeStageCodegen (2)\n \nduration: total (min, med, max (stageId: taskId))\n77 ms (0 ms, 0 ms, 16 ms (stage 305311.0: task 882897))"; 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>13 ms (0 ms, 0 ms, 5 ms (stage 305311.0: task 882895))<br>peak memory total (min, med, max (stageId: taskId))<br>7.5 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 305311.0: task 882894))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#3389200], 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: 30<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#3389200, 30), ENSURE_REQUIREMENTS, [plan_id=974199]"]; subgraph cluster3 { isCluster="true"; id="cluster3"; label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n37 ms (0 ms, 0 ms, 5 ms (stage 305310.0: task 882848))"; 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 305310.0: task 882851))<br>peak memory total (min, med, max (stageId: taskId))<br>9.3 MiB (256.0 KiB, 256.0 KiB, 256.0 KiB (stage 305310.0: task 882848))<br>number of output rows: 0<br>number of sort fallback tasks: 0<br>avg hash probes per key: 0" tooltip="HashAggregate(keys=[shardId#3389200], functions=[])"]; 5 [id="node5" labelType="html" label="<br><b>Project</b><br><br>" tooltip="Project [shardId#3389200]"]; 6 [id="node6" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isOptimal#3389204 <=> false)"]; } 7 [id="node7" labelType="html" label="<b>InMemoryTableScan</b><br><br>number of output rows: 0" tooltip="InMemoryTableScan [isOptimal#3389204, shardId#3389200], [(isOptimal#3389204 <=> false)]"]; subgraph cluster8 { isCluster="true"; id="cluster8"; label="WholeStageCodegen (1)\n \nduration: total (min, med, max (stageId: taskId))\n435 ms (10 ms, 11 ms, 19 ms (stage 305310.0: task 882871))"; tooltip="WholeStageCodegen (1)"; 9 [id="node9" labelType="html" label="<b>Filter</b><br><br>number of output rows: 0" tooltip="Filter (isnotnull(shardId#3389200) AND (shardId#3389200 = 0_3_10000000532))"]; 10 [id="node10" labelType="html" label="<b>Scan ExistingRDD</b><br><br>number of output rows: 4,900" tooltip="Scan ExistingRDD[shardId#3389200,orderProposalId#3389201L,items#3389202,optimizationGroups#3389203,isOptimal#3389204,lastModified#3389205,optimizationInsights#3389206]"]; } 2->1; 4->2; 5->4; 6->5; 7->6; 9->7; 10->9; }