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)
