| From: | Robert Haas <robertmhaas(at)gmail(dot)com> |
|---|---|
| To: | Ronan Dunklau <ronan(dot)dunklau(at)dalibo(dot)com> |
| Cc: | pgsql-hackers Hackers <pgsql-hackers(at)postgresql(dot)org>, Julien Rouhaud <julien(dot)rouhaud(at)dalibo(dot)com> |
| Subject: | Re: [Proposal] Make the optimiser aware of partitions ordering |
| Date: | 2017-03-20 14:52:03 |
| Message-ID: | CA+TgmoY4ifAaf6c6G6ytc_uTBvAkuNa_Aru0HNp-eSA7PA66Dg@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Mon, Mar 20, 2017 at 6:31 AM, Ronan Dunklau <ronan(dot)dunklau(at)dalibo(dot)com> wrote:
> With range partitioning, we guarantee that each partition contains non-
> overlapping values. Since we know the range allowed for each partition, it is
> possible to sort them according to the partition key (as is done already for
> looking up partitions).
>
> Thus, we ca generate sorted Append plans instead of MergeAppend when sorting
> occurs on the partition key.
Great idea. This is too late for v10 at this point, but please add it
to the next CommitFest so we don't forget about it.
--
Robert Haas
EnterpriseDB: http://www.enterprisedb.com
The Enterprise PostgreSQL Company
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2017-03-20 14:54:46 | Re: Re: [COMMITTERS] pgsql: Improve pg_dump regression tests and code coverage |
| Previous Message | Stephen Frost | 2017-03-20 14:47:53 | Re: Inadequate traces in TAP tests |