Re: speeding up planning with partitions
| От | Tom Lane |
|---|---|
| Тема | Re: speeding up planning with partitions |
| Дата | |
| Msg-id | 19663.1553749401@sss.pgh.pa.us обсуждение исходный текст |
| Ответ на | Re: speeding up planning with partitions (Amit Langote <Langote_Amit_f8@lab.ntt.co.jp>) |
| Ответы |
Re: speeding up planning with partitions
|
| Список | pgsql-hackers |
Amit Langote <Langote_Amit_f8@lab.ntt.co.jp> writes:
> On 2019/03/27 23:57, Tom Lane wrote:
>> Yeah, there's something to be said for having plancat.c open each table
>> *and store the Relation pointer in the RelOptInfo*, and then close that
>> again at the end of planning rather than immediately. If we can't avoid
>> these retail table_opens without a great deal of pain, that's the
>> direction I'd tend to go in. However it would add some overhead, in
>> the form of a need to traverse the RelOptInfo array an additional time.
> Just to be sure, do you mean we should do that now or later (David said
> "in the long term")?
It's probably not high priority, though I wonder how much time is being
eaten by the repeated table_opens.
regards, tom lane
В списке pgsql-hackers по дате отправления: