From: | Mariel Cherkassky <mariel(dot)cherkassky(at)gmail(dot)com> |
---|---|
To: | pgsql-performance(at)lists(dot)postgresql(dot)org |
Subject: | pg11 list partitions vs hash partitions |
Date: | 2019-08-19 12:32:10 |
Message-ID: | CA+t6e1k+VuviGp23hBsyTcNrZABO+KmjvE3OQg8YegqgO+bKFg@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
Hey,
I'm trying to understand when using hash partitions can be better than
using list partition when the partition column is bigint. I understand that
If my partition column has many distinct values then If I'll use a list
partitions I might have a lot of partitions. On the other hand, with hash
partitions on that column I can combine a few partition keys to the same
partition.
I understand that maintenance on more partitions is harder but the
performance with list partition should be faster because we will have less
records in each table. Is there any reason hash partitions will be better
than list partitions in aspect of peromance ?
Thanks !
From | Date | Subject | |
---|---|---|---|
Next Message | Arne Roland | 2019-08-19 15:17:21 | Re: Partial join |
Previous Message | Pavel Stehule | 2019-08-18 08:41:11 | Re: UPGRADE TO PG11 CAUSED DEGREDATION IN PERFORMANCE |