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.
- Re: parse partition strategy string in gram.y Japin Li
- Re: parse partition strategy string in gram.y Alvaro Herrera
- Re: parse partition strategy string in gram.y Japin Li
- Re: parse partition strategy string in gram.y Alvaro Herrera
- Re: parse partition strategy string in gram.y Justin Pryzby
- Re: parse partition strategy string in gra... Japin Li
- Re: parse partition strategy string i... Finnerty, Jim
- Re: parse partition strategy stri... Alvaro Herrera
- Re: parse partition strategy stri... Tom Lane
- Re: parse partition strategy stri... Finnerty, Jim
- Re: parse partition strategy stri... Finnerty, Jim
- Re: parse partition strategy stri... Alvaro Herrera
- Re: parse partition strategy stri... Alvaro Herrera
- Re: parse partition strategy string in gram.y Alvaro Herrera
- Re: parse partition strategy string in gram.y Alvaro Herrera