Re: parse partition strategy string in gram.y

[Finnerty, Jim]

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.