Re: parse partition strategy string in gram.y

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