Re: Quadratic planning time for ordered paths over partitioned tables

From: Alvaro Herrera <alvherre(at)alvh(dot)no-ip(dot)org>
To: Aleksander Alekseev <aleksander(at)timescale(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org, Alexander Kuzmenkov <akuzmenkov(at)timescale(dot)com>
Subject: Re: Quadratic planning time for ordered paths over partitioned tables
Date: 2025-01-24 13:37:18
Message-ID: 202501241337.kwi7fmddpbqx@alvherre.pgsql
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: 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/

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Rahila Syed 2025-01-24 13:47:35 Re: Enhancing Memory Context Statistics Reporting
Previous Message David Steele 2025-01-24 13:36:45 Re: Improve verification of recovery_target_timeline GUC.