Re: [PoC] Reducing planning time when tables have many partitions
От | Andrey Lepikhov |
---|---|
Тема | Re: [PoC] Reducing planning time when tables have many partitions |
Дата | |
Msg-id | d22e5d60-425e-ad49-a63b-e79f7ea1acc3@postgrespro.ru обсуждение исходный текст |
Ответ на | Re: [PoC] Reducing planning time when tables have many partitions (Yuya Watari <watari.yuya@gmail.com>) |
Ответы |
Re: [PoC] Reducing planning time when tables have many partitions
|
Список | pgsql-hackers |
On 2/6/23 06:47, Yuya Watari wrote: > Of course, I'm not sure if my approach in v16-0003 is ideal, but it > may help solve your concern above. Since simple_rel_array[0] is no > longer necessary with my patch, I removed the setup_append_rel_entry() > function in v16-0004. However, to work the patch, I needed to change > some assertions in v16-0005. For more details, please see the commit > message of v16-0005. After these works, the attached patches passed > all regression tests in my environment. > > Instead of my approach, imitating the following change to > get_eclass_indexes_for_relids() is also a possible solution. Ignoring > NULL RelOptInfos enables us to avoid the segfault, but we have to > adjust EquivalenceMemberIterator to match the result, and I'm not sure > if this idea is correct. As I see, You moved the indexes from RelOptInfo to PlannerInfo. May be better to move them into RangeTblEntry instead? -- Regards Andrey Lepikhov Postgres Professional
В списке pgsql-hackers по дате отправления: