Stephen Frost <sfr...@snowman.net> writes: > * Tom Lane (t...@sss.pgh.pa.us) wrote: >> However, even granting that that is a concern, so what? You *have* to >> do the planning twice, or you're going to be generating a crap plan for >> one case or the other.
> Yeah, I don't see a way around that.. Also, it occurs to me that it's only necessary to repeat the join search part of the process, which means that in principle the mechanisms already exist for that; see GEQO. This means that for small join problems, the total planning time would much less than double anyway. For large problems, where the join search is the bulk of the time, we could hope that removal of unnecessary joins would reduce the join search runtime enough that the second search would be pretty negligible next to the first (which is not optional). So I think "it'll double the runtime" is an unfounded objection, or at least there's good reason to hope it's unfounded. regards, tom lane -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers