| From: | Dmitry Dolgov <9erthalion6(at)gmail(dot)com> |
|---|---|
| To: | x4mmm(at)yandex-team(dot)ru |
| Cc: | Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Experimenting with hash join prefetch |
| Date: | 2018-10-14 11:16:49 |
| Message-ID: | CA+q6zcXg5-Rc4k0JY+7=gEDGWjCVp0X9t7JdnCuaAfeNmtTEZQ@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
> On Sun, 14 Oct 2018 at 06:19, Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com> wrote:
>
> Cache-oblivious hash joins cause a lot of TLB and cache misses.
> ...
> (There is another class of cache-aware hash join algorithms that partition
> carefully up front to avoid them; that's not us.)
Just out of curiosity, can you please elaborate more on this part (with
references)? I'm thinking about this topic for a while, and I'm wondering, if
by another class you mean something like this [1], then even if it's not us
today, are there any issues that prevent from experimenting in this area?
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Thomas Munro | 2018-10-14 12:33:00 | Re: Experimenting with hash join prefetch |
| Previous Message | Andrey Borodin | 2018-10-14 11:03:02 | Re: B-tree cache prefetches |