Re: [HACKERS] path toward faster partition pruning
От | Amit Langote |
---|---|
Тема | Re: [HACKERS] path toward faster partition pruning |
Дата | |
Msg-id | ec7418ea-5900-7773-8260-60451f3538ea@lab.ntt.co.jp обсуждение исходный текст |
Ответ на | Re: [HACKERS] path toward faster partition pruning (David Rowley <david.rowley@2ndquadrant.com>) |
Список | pgsql-hackers |
Hi David. On 2018/02/17 18:24, David Rowley wrote: > On 2 February 2018 at 23:03, Amit Langote <Langote_Amit_f8@lab.ntt.co.jp> wrote: >> I started wondering if it's not such a good idea to make >> PartitionClauseInfo a Node at all? I went back to your earlier message >> [1] where you said that it's put into the Append node for run-time pruning >> to use, but it doesn't sound nice that we'd be putting into the plan >> something that's looks more like scratchpad for the partition.c code. I >> think we should try to keep PartitionClauseInfo in partition.h and put >> only the list of matched bare clauses into Append. > > That sounds like a good idea. > > A patch which puts this back is attached. > > I've changed the run-time prune patch to process the clause lists > during execution instead. Thank you. I'll incorporate it in the version I'll send next. Regards, Amit
В списке pgsql-hackers по дате отправления: