Re: Hash index build performance tweak from sorting - Mailing list pgsql-hackers

From David Rowley
Subject Re: Hash index build performance tweak from sorting
Date
Msg-id CAApHDvqpKpqLufiR8pBdb8ZugENun7Q-j7dd0a23bUrpSHTvnw@mail.gmail.com
Whole thread Raw
In response to Re: Hash index build performance tweak from sorting  (Tomas Vondra <tomas.vondra@enterprisedb.com>)
Responses Re: Hash index build performance tweak from sorting
List pgsql-hackers
On Fri, 18 Nov 2022 at 03:34, Tomas Vondra
<tomas.vondra@enterprisedb.com> wrote:
> I did some simple benchmark with v2 and v3, using the attached script,
> which essentially just builds hash index on random data, with different
> data types and maintenance_work_mem values. And what I see is this
> (median of 10 runs):

> So to me it seems v2 performs demonstrably better, v3 is consistently
> slower - not only compared to v2, but often also to master.

Could this just be down to code alignment changes?  There does not
really seem to be any fundamental differences which would explain
this.

David



pgsql-hackers by date:

Previous
From: David Rowley
Date:
Subject: Re: Hash index build performance tweak from sorting
Next
From: David Rowley
Date:
Subject: Re: Prefetch the next tuple's memory during seqscans