Re: Add a greedy join search algorithm to handle large join problems

From: Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com>
To: John Naylor <johncnaylorls(at)gmail(dot)com>
Cc: Tomas Vondra <tomas(at)vondra(dot)me>, Chengpeng Yan <chengpeng_yan(at)outlook(dot)com>, "pgsql-hackers(at)lists(dot)postgresql(dot)org" <pgsql-hackers(at)lists(dot)postgresql(dot)org>
Subject: Re: Add a greedy join search algorithm to handle large join problems
Date: 2025-12-11 06:12:29
Message-ID: CAFj8pRCO5ocbr-wFWx5QsKdfkW-=XuQ6zkW5FES7ERQZQHtpwQ@mail.gmail.com
Views: Whole Thread | Raw Message | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

čt 11. 12. 2025 v 3:53 odesílatel John Naylor <johncnaylorls(at)gmail(dot)com>
napsal:

> On Wed, Dec 10, 2025 at 5:20 PM Tomas Vondra <tomas(at)vondra(dot)me> wrote:
> > I did however notice an interesting thing - running EXPLAIN on the 99
> > queries (for 3 scales and 0/4 workers, so 6x 99) took this much time:
> >
> > master: 8s
> > master/geqo: 20s
> > master/goo: 5s
>
> > It's nice that "goo" seems to be faster than "geqo" - assuming the plans
> > are comparable or better. But it surprised me switching to geqo makes it
> > slower than master. That goes against my intuition that geqo is meant to
> > be cheaper/faster join order planning. But maybe I'm missing something.
>
> Yeah, that was surprising. It seems that geqo has a large overhead, so
> it takes a larger join problem for the asymptotic behavior to win over
> exhaustive search.
>

If I understand correctly to design - geqo should be slower for any queries
with smaller complexity. The question is how many queries in the tested
model are really complex.

>
> --
> John Naylor
> Amazon Web Services
>
>
>

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Amit Kapila 2025-12-11 06:19:21 Re: POC: enable logical decoding when wal_level = 'replica' without a server restart
Previous Message Michael Paquier 2025-12-11 05:33:49 Re: Consistently use palloc_object() and palloc_array()