Re: parse partition strategy string in gram.y

From: "Finnerty, Jim" <jfinnert(at)amazon(dot)com>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Alvaro Herrera <alvherre(at)alvh(dot)no-ip(dot)org>
Cc: Japin Li <japinli(at)hotmail(dot)com>, Justin Pryzby <pryzby(at)telsasoft(dot)com>, "pgsql-hackers(at)lists(dot)postgresql(dot)org" <pgsql-hackers(at)lists(dot)postgresql(dot)org>
Subject: Re: parse partition strategy string in gram.y
Date: 2022-10-25 18:36:27
Message-ID: B2B74C3C-9998-4AF9-805B-9F37E946F3B9@amazon.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

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.

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Reid Thompson 2022-10-25 18:51:40 Re: Add tracking of backend memory allocated to pg_stat_activity
Previous Message Reid Thompson 2022-10-25 15:49:03 Re: Add the ability to limit the amount of memory that can be allocated to backends.