@ -2622,8 +2622,7 @@ SET ENABLE_SEQSCAN TO OFF;
planning using heuristic searching. This reduces planning time for
complex queries (those joining many relations), at the cost of producing
plans that are sometimes inferior to those found by the normal
exhaustive-search algorithm. Also, GEQO's searching is randomized and
therefore its plans may vary nondeterministically.
exhaustive-search algorithm.
For more information see <xref linkend="geqo">.
</para>
@ -2662,9 +2661,11 @@ SET ENABLE_SEQSCAN TO OFF;
this many <literal>FROM</> items involved. (Note that a
<literal>FULL OUTER JOIN</> construct counts as only one <literal>FROM</>
item.) The default is 12. For simpler queries it is usually best
to use the deterministic, exhaustive planner, but for queries with
many tables the deterministic planner takes too long, often
longer than the penalty of executing a suboptimal plan.
to use the regular, exhaustive-search planner, but for queries with
many tables the exhaustive search takes too long, often
longer than the penalty of executing a suboptimal plan. Thus,
a threshold on the size of the query is a convenient way to manage
use of GEQO.
</para>
</listitem>
</varlistentry>
@ -2876,7 +2877,7 @@ SELECT * FROM parent WHERE key = 2400;
<para>
Setting this value to <xref linkend="guc-geqo-threshold"> or more
may trigger use of the GEQO planner, resulting in nondeterministic
may trigger use of the GEQO planner, resulting in non-optimal
plans. See <xref linkend="runtime-config-query-geqo">.
</para>
</listitem>
@ -2911,7 +2912,7 @@ SELECT * FROM parent WHERE key = 2400;
<para>
Setting this value to <xref linkend="guc-geqo-threshold"> or more
may trigger use of the GEQO planner, resulting in nondeterministic
may trigger use of the GEQO planner, resulting in non-optimal
plans. See <xref linkend="runtime-config-query-geqo">.
</para>
</listitem>