Horton

Re: parse partition strategy string in gram.y

Alvaro Herrera <alvherre@alvh.no-ip.org>

View thread View on postgr.es
From: Alvaro Herrera <alvherre@alvh.no-ip.org>
To: "Finnerty, Jim" <jfinnert@amazon.com>
Cc: Tom Lane <tgl@sss.pgh.pa.us>, Japin Li <japinli@hotmail.com>, Justin Pryzby <pryzby@telsasoft.com>, "pgsql-hackers@lists.postgresql.org" <pgsql-hackers@lists.postgresql.org>
Date: 2022-10-25T23:15:32Z
Lists: pgsql-hackers 
On 2022-Oct-25, Finnerty, Jim wrote:

> Or if you know the frequencies of the highly frequent values of the
> partitioning key at the time the partition bounds are defined, you
> could define hash ranges that contain approximately the same number of
> rows in each partition.  A parallel sequential scan of all partitions
> would then perform better because data skew is minimized. 

This sounds very much like list partitioning to me.

-- 
Álvaro Herrera        Breisgau, Deutschland  —  https://www.EnterpriseDB.com/
"The problem with the future is that it keeps turning into the present"
(Hobbes)

Commits

  1. meson: Split 'main' suite into 'regress' and 'isolation'

  2. Resolve partition strategy during early parsing