Re: Quadratic planning time for ordered paths over partitioned tables

Hi,

> > I think this is closely related to the work Yuya Watari has been doing
> > at
> > https://postgr.es/m/CAJ2pMkZZHrhgQ5UV0y+STKqx7XVGzENMhL98UbKM-OArvK9dmA@mail.gmail.com
> > Perhaps you could contribute by reviewing that patch series.
>
> Yeah, I'm referencing this one in my email, but it's a series of
> patches that does a major refactoring changing thousands of lines. I'm
> not sure when or if it's going to land, do you think applying a quick
> fix first would make sense? It makes trivial changes in one function.

It looks like the author keeps the patch set up to date. Although he
proposes a complicated refactoring this is better than "quick and
dirty fix" as you put it, IMO. So I suggest focusing on this patch
set. On top of that somehow I doubt we will find a committer willing
to be responsible for merging anything quick and dirty anyway.

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

-- 
Best regards,
Aleksander Alekseev