geqo_generations

Definition PG 18 manual

Controls the number of generations used by GEQO, that is the number of iterations of the algorithm. It must be at least one, and useful values are in the same range as the pool size. If it is set to zero (the default setting) then a suitable value is chosen based on geqo_pool_size.

How it works

It sets the number of evolutionary iterations; zero derives a value from the selected pool size.

GEQO trades bounded planning time for a heuristic search that can miss the best join order. It still costs scan and join paths with the ordinary planner cost model after constructing candidates.

The setting is read during planning, and GEQO's randomized search means plan quality can vary with seed and search budget. Collapse limits can change the number of relations exposed to the join search and therefore whether the threshold is crossed. Its user context permits session- or transaction-local changes; newly performed or newly planned work sees the value.

Operational considerations

Judging plan quality from one randomized GEQO run.

Changing a GEQO knob without accounting for geqo_threshold and collapse limits.

Spending much more planning CPU for a marginal or unstable execution-time gain.

Assuming GEQO guarantees the globally best join order.

Workload guidance

OLAP: For recurring many-table reports, test geqo_generations with multiple geqo_seed values and compare planning plus execution time. A single lucky seed is not a stable production policy.

OLTP: Keep geqo_generations at its upstream default unless planning time for many-way joins is measured as a problem. Prefer simplifying generated SQL or fixing join estimates before expanding a randomized search budget globally.

SMALL: Avoid increasing geqo_generations in ways that consume disproportionate planning CPU on a small host. The default adaptive values are safer than copying a large-system GEQO budget.