| From: | Yuto Hayamizu <y(dot)hayamizu(at)gmail(dot)com> |
|---|---|
| To: | Ashutosh Bapat <ashutosh(dot)bapat(at)enterprisedb(dot)com> |
| Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Robert Haas <robertmhaas(at)gmail(dot)com>, Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: [HACKERS] [PATCH] Overestimated filter cost and its mitigation |
| Date: | 2018-01-19 08:27:33 |
| Message-ID: | CANE+7D9pTaK_6QjLWG50DHZOjzAAaUCd7Wj4S9YTjafJtHCu9w@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, Nov 9, 2017 at 12:33 PM, Ashutosh Bapat
<ashutosh(dot)bapat(at)enterprisedb(dot)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
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Masahiko Sawada | 2018-01-19 08:43:15 | Re: Typo in slotfuncs.c |
| Previous Message | Kyotaro HORIGUCHI | 2018-01-19 08:26:46 | Re: [HACKERS] [PATCH] Improve geometric types |