Re: Quadratic planning time for ordered paths over partitioned tables

From: Alexander Kuzmenkov <akuzmenkov(at)timescale(dot)com>
To: Alvaro Herrera <alvherre(at)alvh(dot)no-ip(dot)org>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: Quadratic planning time for ordered paths over partitioned tables
Date: 2025-01-24 14:40:03
Message-ID: CALzhyqw1JY6wH+zjPieQTK3oWfG1Ar9OqbpnyrKhHq+GOzt7eQ@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Fri, Jan 24, 2025 at 2:37 PM Alvaro Herrera <alvherre(at)alvh(dot)no-ip(dot)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.

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Frédéric Yhuel 2025-01-24 14:41:46 Re: doc: explain pgstatindex fragmentation
Previous Message Bertrand Drouvot 2025-01-24 14:20:24 Re: Show WAL write and fsync stats in pg_stat_io