vpruthi/doc-exports
1
0
Fork 0
forked from docs/doc-exports
Code Pull Requests Activity
doc-exports/docs/dws/dev/dws_04_0485.html
Lu, Huayi e6fa411af0 DWS DEV 830.201 version 
Reviewed-by: Pruthi, Vineet <vineet.pruthi@t-systems.com>
Co-authored-by: Lu, Huayi <luhuayi@huawei.com>
Co-committed-by: Lu, Huayi <luhuayi@huawei.com>
2024-05-16 07:24:04 +00:00

111 lines
25 KiB
HTML
Raw Blame History

<a name="EN-US_TOPIC_0000001188642154"></a><a name="EN-US_TOPIC_0000001188642154"></a>
<h1 class="topictitle1">Case: Adjusting the GUC Parameter best_agg_plan</h1>
<div id="body8662426"><div class="section" id="EN-US_TOPIC_0000001188642154__s4288e7bd1e0a421c8dbe9980514ccf5f"><h4 class="sectiontitle">Symptom</h4><p id="EN-US_TOPIC_0000001188642154__a229b8ee0060b42189f8de9ce4fed1f5f">The t1 table is defined as follows: </p>
<div class="codecoloring" codetype="Sql" id="EN-US_TOPIC_0000001188642154__sca2a7f3aefb04702a49d85f069dc993b"><div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span class="normal">1</span></pre></div></td><td class="code"><div><pre><span></span><span class="k">create</span><span class="w"> </span><span class="k">table</span><span class="w"> </span><span class="n">t1</span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="nb">int</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="nb">int</span><span class="p">,</span><span class="w"> </span><span class="k">c</span><span class="w"> </span><span class="nb">int</span><span class="p">)</span><span class="w"> </span><span class="n">distribute</span><span class="w"> </span><span class="k">by</span><span class="w"> </span><span class="n">hash</span><span class="p">(</span><span class="n">a</span><span class="p">);</span>
</pre></div></td></tr></table></div>
</div>
<p id="EN-US_TOPIC_0000001188642154__a40b9fa332afe447ca864901afe669049">Assume that the distribution column of the result set provided by the agg lower-layer operator is setA, and the group by column of the agg operation is setB, the agg operations can be performed in two scenarios in the stream framework.</p>
<p id="EN-US_TOPIC_0000001188642154__p965062214594"><strong id="EN-US_TOPIC_0000001188642154__b130211211806">Scenario 1: setA is a subset of setB.</strong></p>
<p class="litext" id="EN-US_TOPIC_0000001188642154__ade241027ca2d4a90852bb8cb604adb51">In this scenario, the aggregation result of the lower-layer result set is the correct result, which can be directly used by the upper-layer operator. For details, see the following figure:</p>
<div class="codecoloring" codetype="Sql" id="EN-US_TOPIC_0000001188642154__s87dd3a7069b446709eb970102ccce2a5"><div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span class="normal">1</span>
<span class="normal">2</span>
<span class="normal">3</span>
<span class="normal">4</span>
<span class="normal">5</span>
<span class="normal">6</span>
<span class="normal">7</span></pre></div></td><td class="code"><div><pre><span></span><span class="k">explain</span><span class="w"> </span><span class="k">select</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="k">count</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">from</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="k">group</span><span class="w"> </span><span class="k">by</span><span class="w"> </span><span class="n">a</span><span class="p">;</span>
<span class="w"> </span><span class="n">id</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="k">operation</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="k">rows</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">width</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">costs</span><span class="w"> </span>
<span class="c1">----+------------------------------+--------+---------+---------</span>
<span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Streaming</span><span class="w"> </span><span class="p">(</span><span class="k">type</span><span class="p">:</span><span class="w"> </span><span class="n">GATHER</span><span class="p">)</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">15</span><span class="p">.</span><span class="mi">56</span><span class="w"> </span>
<span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">HashAggregate</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">31</span><span class="w"> </span>
<span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Seq</span><span class="w"> </span><span class="n">Scan</span><span class="w"> </span><span class="k">on</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">14</span><span class="w"> </span>
<span class="p">(</span><span class="mi">3</span><span class="w"> </span><span class="k">rows</span><span class="p">)</span>
</pre></div></td></tr></table></div>
</div>
<p id="EN-US_TOPIC_0000001188642154__p5411161516591"><strong id="EN-US_TOPIC_0000001188642154__b1194010258015">Scenario 2: setA is not a subset of setB.</strong></p>
<p id="EN-US_TOPIC_0000001188642154__afb5a14d64f47434b82e839c1663167b1">In this scenario, the Stream execution framework is classified into the following three plans:</p>
<p id="EN-US_TOPIC_0000001188642154__ada69395b80654d93ad4609fe6de5c5fd">hashagg+gather(redistribute)+hashagg</p>
<p id="EN-US_TOPIC_0000001188642154__a7a1e1fd024124c2aa5395d5fe791a265">redistribute+hashagg(+gather)</p>
<p id="EN-US_TOPIC_0000001188642154__en-us_topic_0075928493_p789008171716">hashagg+redistribute+hashagg(+gather)</p>
<p id="EN-US_TOPIC_0000001188642154__a90cd39d699f34455b4708cbdb51b0b6a"><span id="EN-US_TOPIC_0000001188642154__text42191246">GaussDB(DWS)</span> provides the guc parameter <strong id="EN-US_TOPIC_0000001188642154__b842352706143254">best_agg_plan</strong> to intervene the execution plan, and forces the plan to generate the corresponding execution plan. This parameter can be set to <strong id="EN-US_TOPIC_0000001188642154__b842352706204737">0</strong>, <strong id="EN-US_TOPIC_0000001188642154__b842352706204740">1</strong>, <strong id="EN-US_TOPIC_0000001188642154__b842352706204743">2</strong>, and <strong id="EN-US_TOPIC_0000001188642154__b842352706204747">3</strong>.</p>
<ul id="EN-US_TOPIC_0000001188642154__ufd6ed2c0681f459794b948801f210f9f"><li id="EN-US_TOPIC_0000001188642154__la340e87e1e5b466c9e51469b2858a03e">When the value is set to <strong id="EN-US_TOPIC_0000001188642154__b93285805111552">1</strong>, the first plan is forcibly generated.</li><li id="EN-US_TOPIC_0000001188642154__l8e6a8abc29fc4a60b4624dae525d7410">When the value is set to <strong id="EN-US_TOPIC_0000001188642154__b84235270694025">2</strong> and if the <strong id="EN-US_TOPIC_0000001188642154__b842352706114610">group by</strong> column can be redistributed, the second plan is forcibly generated. Otherwise, the first plan is generated.</li><li id="EN-US_TOPIC_0000001188642154__l31136023bbcb41f19eb65abf2d2d9461">When the value is set to <strong id="EN-US_TOPIC_0000001188642154__b84235270694153">3</strong> and if the <strong id="EN-US_TOPIC_0000001188642154__b18762497829427">group by</strong> column can be redistributed, the third plan is generated. Otherwise, the first plan is generated.</li><li id="EN-US_TOPIC_0000001188642154__l4f1b9671385248acb67f0e94874b52cb">When the value is set to <strong id="EN-US_TOPIC_0000001188642154__en-us_topic_0059778346_en-us_topic_0058967673_b84235270694450">0</strong>, the query optimizer chooses the most optimal plan by the three preceding plans' evaluation cost.</li></ul>
<p id="EN-US_TOPIC_0000001188642154__a1b194c616a45425886e18faba6c3632c">Possible impacts are as follows:</p>
<div class="codecoloring" codetype="Sql" id="EN-US_TOPIC_0000001188642154__s0487e47d3c4f4ccc984ffb49ec912f4a"><div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span class="normal"> 1</span>
<span class="normal"> 2</span>
<span class="normal"> 3</span>
<span class="normal"> 4</span>
<span class="normal"> 5</span>
<span class="normal"> 6</span>
<span class="normal"> 7</span>
<span class="normal"> 8</span>
<span class="normal"> 9</span>
<span class="normal">10</span>
<span class="normal">11</span>
<span class="normal">12</span>
<span class="normal">13</span>
<span class="normal">14</span>
<span class="normal">15</span>
<span class="normal">16</span>
<span class="normal">17</span>
<span class="normal">18</span>
<span class="normal">19</span>
<span class="normal">20</span>
<span class="normal">21</span>
<span class="normal">22</span>
<span class="normal">23</span>
<span class="normal">24</span>
<span class="normal">25</span>
<span class="normal">26</span>
<span class="normal">27</span>
<span class="normal">28</span>
<span class="normal">29</span>
<span class="normal">30</span>
<span class="normal">31</span></pre></div></td><td class="code"><div><pre><span></span><span class="k">set</span><span class="w"> </span><span class="n">best_agg_plan</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span>
<span class="k">SET</span>
<span class="k">explain</span><span class="w"> </span><span class="k">select</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="k">count</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">from</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="k">group</span><span class="w"> </span><span class="k">by</span><span class="w"> </span><span class="n">b</span><span class="p">;</span>
<span class="w"> </span><span class="n">id</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="k">operation</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="k">rows</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">width</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">costs</span><span class="w"> </span>
<span class="c1">----+---------------------------------+--------+---------+---------</span>
<span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">HashAggregate</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">8</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">15</span><span class="p">.</span><span class="mi">83</span><span class="w"> </span>
<span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Streaming</span><span class="w"> </span><span class="p">(</span><span class="k">type</span><span class="p">:</span><span class="w"> </span><span class="n">GATHER</span><span class="p">)</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">25</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">15</span><span class="p">.</span><span class="mi">83</span><span class="w"> </span>
<span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">HashAggregate</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">25</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">33</span><span class="w"> </span>
<span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Seq</span><span class="w"> </span><span class="n">Scan</span><span class="w"> </span><span class="k">on</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">14</span><span class="w"> </span>
<span class="p">(</span><span class="mi">4</span><span class="w"> </span><span class="k">rows</span><span class="p">)</span>
<span class="k">set</span><span class="w"> </span><span class="n">best_agg_plan</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">2</span><span class="p">;</span>
<span class="k">SET</span>
<span class="k">explain</span><span class="w"> </span><span class="k">select</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="k">count</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">from</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="k">group</span><span class="w"> </span><span class="k">by</span><span class="w"> </span><span class="n">b</span><span class="p">;</span>
<span class="w"> </span><span class="n">id</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="k">operation</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="k">rows</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">width</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">costs</span><span class="w"> </span>
<span class="c1">----+-----------------------------------------+--------+---------+---------</span>
<span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Streaming</span><span class="w"> </span><span class="p">(</span><span class="k">type</span><span class="p">:</span><span class="w"> </span><span class="n">GATHER</span><span class="p">)</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">15</span><span class="p">.</span><span class="mi">85</span><span class="w"> </span>
<span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">HashAggregate</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">60</span><span class="w"> </span>
<span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Streaming</span><span class="p">(</span><span class="k">type</span><span class="p">:</span><span class="w"> </span><span class="n">REDISTRIBUTE</span><span class="p">)</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">45</span><span class="w"> </span>
<span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Seq</span><span class="w"> </span><span class="n">Scan</span><span class="w"> </span><span class="k">on</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">14</span><span class="w"> </span>
<span class="p">(</span><span class="mi">4</span><span class="w"> </span><span class="k">rows</span><span class="p">)</span>
<span class="k">set</span><span class="w"> </span><span class="n">best_agg_plan</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">3</span><span class="p">;</span>
<span class="k">SET</span>
<span class="k">explain</span><span class="w"> </span><span class="k">select</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="k">count</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">from</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="k">group</span><span class="w"> </span><span class="k">by</span><span class="w"> </span><span class="n">b</span><span class="p">;</span>
<span class="w"> </span><span class="n">id</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="k">operation</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="k">rows</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">width</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">E</span><span class="o">-</span><span class="n">costs</span><span class="w"> </span>
<span class="c1">----+-----------------------------------------+--------+---------+---------</span>
<span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Streaming</span><span class="w"> </span><span class="p">(</span><span class="k">type</span><span class="p">:</span><span class="w"> </span><span class="n">GATHER</span><span class="p">)</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">15</span><span class="p">.</span><span class="mi">84</span><span class="w"> </span>
<span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">HashAggregate</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">59</span><span class="w"> </span>
<span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Streaming</span><span class="p">(</span><span class="k">type</span><span class="p">:</span><span class="w"> </span><span class="n">REDISTRIBUTE</span><span class="p">)</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">25</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">59</span><span class="w"> </span>
<span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">HashAggregate</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">25</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">33</span><span class="w"> </span>
<span class="w"> </span><span class="mi">5</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">Seq</span><span class="w"> </span><span class="n">Scan</span><span class="w"> </span><span class="k">on</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">4</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">14</span><span class="p">.</span><span class="mi">14</span><span class="w"> </span>
<span class="p">(</span><span class="mi">5</span><span class="w"> </span><span class="k">rows</span><span class="p">)</span>
</pre></div></td></tr></table></div>
</div>
</div>
<div class="section" id="EN-US_TOPIC_0000001188642154__sca08850df5b04f8da78009cf074ec6b7"><h4 class="sectiontitle">Summary</h4><p id="EN-US_TOPIC_0000001188642154__aac27ba466bc5438c9bb7a950174ce4d6">Generally, the optimizer chooses an optimal execution plan, but the cost estimation, especially that of the intermediate result set, has large deviations, which may result in large deviations in agg calculation. In this case, you need to use best_agg_plan to adjust the agg calculation model.</p>
<p id="EN-US_TOPIC_0000001188642154__ab5b6130aeb7f48c888776418b07ed837">When the aggregation convergence ratio is very small, that is, the number of result sets does not become small obviously after the agg operation (5 times is a critical point), you can select the redistribute+hashagg or hashagg+redistribute+hashagg execution mode.</p>
</div>
</div>
<div>
<div class="familylinks">
<div class="parentlink"><strong>Parent topic:</strong> <a href="dws_04_0474.html">Optimization Cases</a></div>
</div>
</div>
View Git Blame Copy Permalink