From: | tgl(at)postgresql(dot)org (Tom Lane) |
---|---|
To: | pgsql-committers(at)postgresql(dot)org |
Subject: | pgsql: Buy back some of the cycles spent in more-expensive hash |
Date: | 2007-06-01 17:38:44 |
Message-ID: | 20070601173844.4D7119FC4C0@postgresql.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-committers |
Log Message:
-----------
Buy back some of the cycles spent in more-expensive hash functions by
selecting power-of-2, rather than prime, numbers of buckets in hash joins.
If the hash functions are doing their jobs properly by making all hash bits
equally random, this is good enough, and it saves expensive integer division
and modulus operations.
Modified Files:
--------------
pgsql/src/backend/executor:
nodeHash.c (r1.111 -> r1.112)
(http://developer.postgresql.org/cvsweb.cgi/pgsql/src/backend/executor/nodeHash.c.diff?r1=1.111&r2=1.112)
pgsql/src/include/executor:
hashjoin.h (r1.44 -> r1.45)
(http://developer.postgresql.org/cvsweb.cgi/pgsql/src/include/executor/hashjoin.h.diff?r1=1.44&r2=1.45)
From | Date | Subject | |
---|---|---|---|
Next Message | Bruce Momjian | 2007-06-01 18:40:43 | pgsql: Update wording: o Research self-referential UPDATEs that |
Previous Message | Tom Lane | 2007-06-01 15:58:09 | pgsql: Fix performance problems in multi-batch hash joins by ensuring |