Re: [HACKERS] [PATCH] Overestimated filter cost and its mitigation

Поиск
Список
Период
Сортировка
От Yuto Hayamizu
Тема Re: [HACKERS] [PATCH] Overestimated filter cost and its mitigation
Дата
Msg-id CANE+7D9pTaK_6QjLWG50DHZOjzAAaUCd7Wj4S9YTjafJtHCu9w@mail.gmail.com
обсуждение исходный текст
Ответ на Re: [HACKERS] [PATCH] Overestimated filter cost and its mitigation  (Ashutosh Bapat <ashutosh.bapat@enterprisedb.com>)
Список pgsql-hackers
On Thu, Nov 9, 2017 at 12:33 PM, Ashutosh Bapat
<ashutosh.bapat@enterprisedb.com> wrote:
> different set, within each set the order is same. FWIW, we can order
> all clauses in largest set once and use that order every time. Albeit
> we will have to remember the order somewhere OR make the separator
> routine retain the order in the larger set, which I guess is true
> about all separator functions.

For this patch, sorting of a qual list happens only once for each
range table entry, not for each path. So there is no need for caching
sorted qual lists as far as I know.

----
regards,
Yuto Hayamizu


В списке pgsql-hackers по дате отправления:

Предыдущее
От: Kyotaro HORIGUCHI
Дата:
Сообщение: Re: [HACKERS] [PATCH] Improve geometric types
Следующее
От: Masahiko Sawada
Дата:
Сообщение: Re: Typo in slotfuncs.c