| From: | Amit Langote <Langote_Amit_f8(at)lab(dot)ntt(dot)co(dot)jp> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Alvaro Herrera <alvherre(at)alvh(dot)no-ip(dot)org> |
| Cc: | David Steele <david(at)pgmasters(dot)net>, Amit Langote <amitlangote09(at)gmail(dot)com>, Kyotaro HORIGUCHI <horiguchi(dot)kyotaro(at)lab(dot)ntt(dot)co(dot)jp>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: reorganizing partitioning code |
| Date: | 2018-03-28 04:07:03 |
| Message-ID: | 8e1b2d9e-fa5b-de8a-b9e1-99f197ba00bc@lab.ntt.co.jp |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 2018/03/22 11:45, Amit Langote wrote:
> FWIW, I did manage to rebase it this morning and posting it here.
Rebased again.
I started wondering if we should separate out stuff related to partition
bounds. That is create a utils/partbound.h and put PartitionBoundInfo and
related comparison and search functions into a utils/adt/partbound.c. I
had started thinking about that when I looked at the code added by the
patch submitted on the "advanced partition matching algorithm for
partition-wise join" thread [1]. I haven't done anything about that though.
Thanks,
Amit
| Attachment | Content-Type | Size |
|---|---|---|
| v6-0001-Reorganize-partitioning-code.patch | text/plain | 164.8 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Pavan Deolasee | 2018-03-28 04:30:41 | Re: [HACKERS] MERGE SQL Statement for PG11 |
| Previous Message | David Rowley | 2018-03-28 03:58:08 | Re: [HACKERS] path toward faster partition pruning |