Small performance improvement for hash joins and hash aggregation:

Tom Lane <tgl@sss.pgh.pa.us>

Commit: d24d75ff194e292fe49c6c84d0124cc61b182d3c
Author: Tom Lane <tgl@sss.pgh.pa.us>
Date: 2003-05-30T20:23:10Z
Releases: 7.4.1
Small performance improvement for hash joins and hash aggregation:
when the plan is ReScanned, we don't have to rebuild the hash table
if there is no parameter change for its child node.  This idea has
been used for a long time in Sort and Material nodes, but was not in
the hash code till now.

Files

PathChange+/−
src/backend/executor/nodeAgg.c modified +31 −2
src/backend/executor/nodeHashjoin.c modified +45 −38