Re: Quadratic planning time for ordered paths over partitioned tables - Mailing list pgsql-hackers

From Alvaro Herrera
Subject Re: Quadratic planning time for ordered paths over partitioned tables
Date
Msg-id 202501241337.kwi7fmddpbqx@alvherre.pgsql
Whole thread Raw
In response to Re: Quadratic planning time for ordered paths over partitioned tables  (Aleksander Alekseev <aleksander@timescale.com>)
Responses Re: Quadratic planning time for ordered paths over partitioned tables
List pgsql-hackers
On 2025-Jan-24, Aleksander Alekseev wrote:

> Did you consider checking if the referenced patchset addresses the
> issue you described?

I ran Kuzmenkov's test case with Watari-san's patch.  Planning time goes
from 2700ms to 600ms or so.

-- 
Álvaro Herrera        Breisgau, Deutschland  —  https://www.EnterpriseDB.com/



pgsql-hackers by date:

Previous
From: Bertrand Drouvot
Date:
Subject: Re: doc: explain pgstatindex fragmentation
Next
From: Rahila Syed
Date:
Subject: Re: Enhancing Memory Context Statistics Reporting