Re: Hash index build performance tweak from sorting
David Rowley <dgrowleyml@gmail.com>
From: David Rowley <dgrowleyml@gmail.com>
To: Simon Riggs <simon.riggs@enterprisedb.com>
Cc: Tom Lane <tgl@sss.pgh.pa.us>, Amit Kapila <amit.kapila16@gmail.com>, PostgreSQL Hackers <pgsql-hackers@postgresql.org>
Date: 2022-11-24T04:24:54Z
Lists: pgsql-hackers
On Thu, 24 Nov 2022 at 02:27, Simon Riggs <simon.riggs@enterprisedb.com> wrote: > > On Wed, 23 Nov 2022 at 13:04, David Rowley <dgrowleyml@gmail.com> wrote: > > I'd rather see this solved like v4 is doing it. > > Please do. No further comments. Thanks for your help Thanks. I pushed the v4 patch with some minor comment adjustments and also renamed _hash_pgaddtup()'s new parameter to "appendtup". I felt that better reflected what the parameter does in that function. David
Commits
-
Speedup hash index builds by skipping needless binary searches
- d09dbeb9bde6 16.0 landed
-
Improve speed of hash index build.
- e09d7a1262c6 16.0 landed
-
Change hash indexes to store only the hash code rather than the whole indexed
- 4adc2f72a4cc 8.4.0 cited