| From: | Ron <ronljohnsonjr(at)gmail(dot)com> |
|---|---|
| To: | pgsql-general(at)lists(dot)postgresql(dot)org |
| Subject: | Re: When to use PARTITION BY HASH? |
| Date: | 2020-06-08 13:07:04 |
| Message-ID: | 0592c44a-cd2b-da4b-4dea-2017ae41507a@gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general pgsql-performance |
On 6/8/20 3:40 AM, Oleksandr Shulgin wrote:
[snip]
> I've found the original commit adding this feature in version 11:
> https://git.postgresql.org/gitweb/?p=postgresql.git;a=commit;h=1aba8e651ac3e37e1d2d875842de1e0ed22a651e
> It says:
>
> "Hash partitioning is useful when you want to partition a growing data
> set evenly. This can be useful to keep table sizes reasonable, which
> makes maintenance operations such as VACUUM faster, or to enable
> partition-wise join."
How does hashed (meaning "randomly?) distribution of records make
partition-wise joins more efficient?
Or -- since I interpret that as having to do with "locality of data" -- am I
misunderstanding the meaning of "partition-wise joins"?
--
Angular momentum makes the world go 'round.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Adrian Klaver | 2020-06-08 13:14:42 | Re: "INSERT ON CONFLICT UPDATE" - Use of indexes ? |
| Previous Message | Laura Smith | 2020-06-08 12:42:29 | "INSERT ON CONFLICT UPDATE" - Use of indexes ? |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | David Rowley | 2020-06-08 21:25:12 | Re: When to use PARTITION BY HASH? |
| Previous Message | Michaeldba@sqlexec.com | 2020-06-08 09:50:35 | Re: When to use PARTITION BY HASH? |