Re: Quadratic planning time for ordered paths over partitioned tables

Поиск
Список
Период
Сортировка
От Alexander Kuzmenkov
Тема Re: Quadratic planning time for ordered paths over partitioned tables
Дата
Msg-id CALzhyqw1JY6wH+zjPieQTK3oWfG1Ar9OqbpnyrKhHq+GOzt7eQ@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Quadratic planning time for ordered paths over partitioned tables  (Alvaro Herrera <alvherre@alvh.no-ip.org>)
Список pgsql-hackers
Дерево обсуждения 
On Fri, Jan 24, 2025 at 2:37 PM Alvaro Herrera <alvherre@alvh.no-ip.org> wrote:
> I ran Kuzmenkov's test case with Watari-san's patch.  Planning time goes
> from 2700ms to 600ms or so.

Thank you, good to know that it helps this case as well.

В списке pgsql-hackers по дате отправления: