ml#GUC-GEQO-THRESHOLD">geqo_threshold</a>).
    </p></div><p>
    The planner's search procedure actually works with data structures
    called <em class="firstterm">paths</em>, which are simply cut-down representations of
    plans containing only as much information as the planner needs to make
    its decisions. After the cheapest path is determined, a full-fledged
    <em class="firstterm">plan tree</em> is built to pass to the executor.  This represents
    the desired execution plan in sufficient deta