Re: Experimenting with hash join prefetch

From: Andrey Borodin <x4mmm(at)yandex-team(dot)ru>
To: Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com>
Cc: Pg Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Experimenting with hash join prefetch
Date: 2018-10-14 10:10:58
Message-ID: 2EB14DC6-8F68-4FF3-A526-60F9D3C77E58@yandex-team.ru
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers


Hi, Thomas!
> 14 окт. 2018 г., в 9:18, Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com> написал(а):
>
> + /* Prefetch the bucket for the next key */
> + uint32 next_hash = hash_uint32(DatumGetInt32(keyval) + 1);
> + uint32 next_bucket = next_hash % hashtable->nbuckets;
> + __builtin_prefetch(&hashtable->buckets.unshared[next_bucket]);

+1, I also think that we should use __builtin_prefetch these days (years, actually).
Exactly after listening Anastassia Ailamaki's (author of referenced paper) talk on VLDB I've proposed to do that for B-tree [0], but did not really pursuit that idea.

[0] https://www.postgresql.org/message-id/3B774C9E-01E8-46A7-9642-7830DC1108F1%40yandex-team.ru

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Andrey Borodin 2018-10-14 11:03:02 Re: B-tree cache prefetches
Previous Message Thomas Munro 2018-10-14 04:18:19 Experimenting with hash join prefetch