From: Alvaro Herrera <alvherre@alvh.no-ip.org>
To: Finnerty, Jim <jfinnert@amazon.com>
Cc: Tom Lane <tgl@sss.pgh.pa.us>
Cc: Japin Li <japinli@hotmail.com>
Cc: Justin Pryzby <pryzby@telsasoft.com>
Cc: pgsql-hackers@lists.postgresql.org <pgsql-hackers@lists.postgresql.org>
Subject: Re: parse partition strategy string in gram.y
Date: Wed, 26 Oct 2022 01:15:32 +0200
Message-ID: <20221025231532.ndofmybeizfcaclj@alvherre.pgsql> (raw)
In-Reply-To: <B2B74C3C-9998-4AF9-805B-9F37E946F3B9@amazon.com>
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)
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-hackers@postgresql.org
Cc: alvherre@alvh.no-ip.org, jfinnert@amazon.com, tgl@sss.pgh.pa.us, japinli@hotmail.com, pryzby@telsasoft.com, pgsql-hackers@lists.postgresql.org
Subject: Re: parse partition strategy string in gram.y
In-Reply-To: <20221025231532.ndofmybeizfcaclj@alvherre.pgsql>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox