marcin mank <marcin.mank@gmail.com> writes:
> This is pretty off-topic, but if we had some upper bound on the cost
> of the complete plan, we could discard pieces of the plan that already
> cost more.
> One way to get the upper bound is to generate the plan in depth-first
> fashion, instead of the current breadth-first. Instead of bottom-up
> dynamic programming, employ memoization.
Well, the breadth-first approach also allows elimination of large parts
of the search space. It's not immediately obvious to me that the above
would be better. You should be able to try it if you want though ---
these days, there's even a hook to allow replacement of the join search
strategy at runtime.
regards, tom lane