Re: Quadratic planning time for ordered paths over partitioned tables

[Alexander Kuzmenkov]

On Fri, Jan 24, 2025 at 2:37 PM Alvaro Herrera <alvhe...@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.