Re: POC: GROUP BY optimization

From: Michael Paquier <michael(at)paquier(dot)xyz>
To: Gavin Flower <GavinFlower(at)archidevsys(dot)co(dot)nz>
Cc: pgsql-hackers(at)lists(dot)postgresql(dot)org
Subject: Re: POC: GROUP BY optimization
Date: 2018-10-02 02:16:26
Message-ID: 20181002021626.GF11712@paquier.xyz
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Sat, Jun 30, 2018 at 09:19:13AM +1200, Gavin Flower wrote:
> Additionally put an upper limit threshold on the number of combinations to
> check, fairly large by default?
>
> If first threshold is exceeded, could consider checking out a few more
> selected at random from paths not yet checked, to avoid any bias caused by
> stopping a systematic search.  This might prove important when N! is fairly
> large.

Please note that the latest patch available does not apply, so this has
been moved to next CF 2018-11, waiting for input from its author.
--
Michael

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message David Rowley 2018-10-02 02:21:06 Re: Subplan result caching
Previous Message Michael Paquier 2018-10-02 02:11:58 Re: Subplan result caching