From: | Amit Langote <Langote_Amit_f8(at)lab(dot)ntt(dot)co(dot)jp> |
---|---|
To: | Amit Khandekar <amitdkhan(dot)pg(at)gmail(dot)com>, Robert Haas <robertmhaas(at)gmail(dot)com> |
Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>, Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com> |
Subject: | Re: [HACKERS] UPDATE of partition key |
Date: | 2017-11-24 05:22:18 |
Message-ID: | 3348a7d8-39b1-e367-8995-7a8a8d3dea69@lab.ntt.co.jp |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 2017/11/23 21:57, Amit Khandekar wrote:
> If we collect the partition keys in expand_partitioned_rtentry(), we
> need to pass the root relation also, so that we can convert the
> partition key attributes to root rel descriptor. And the other thing
> is, may be, we can check beforehand (in expand_inherited_rtentry)
> whether the rootrte's updatedCols is empty, which I think implies that
> it's not an UPDATE operation. If yes, we can just skip collecting the
> partition keys.
Yeah, it seems like a good idea after all to check in
expand_inherited_rtentry() whether the root RTE's updatedCols is non-empty
and if so check if any of the updatedCols are partition keys. If we find
some, then it will suffice to just set a simple flag in the
PartitionedChildRelInfo that will be created for the root table. That
should be done *after* we have visited all the tables in the partition
tree including some that might be partitioned and hence will provide their
partition keys. The following block in expand_inherited_rtentry() looks
like a good spot:
if (rte->inh && partitioned_child_rels != NIL)
{
PartitionedChildRelInfo *pcinfo;
pcinfo = makeNode(PartitionedChildRelInfo);
Thanks,
Amit
From | Date | Subject | |
---|---|---|---|
Next Message | Rafia Sabih | 2017-11-24 05:36:17 | Re: [HACKERS] Parallel Append implementation |
Previous Message | Amit Langote | 2017-11-24 05:00:22 | Re: [HACKERS] path toward faster partition pruning |