Log Message:
-----------
Tweak hash join code to use an additional heuristic for deciding whether
it's worth probing the outer relation for emptiness before building the
hash table. To wit, if we're rescanning a join previously performed,
remember whether we found it nonempty the previous time, and don't bother
with the probe if it was nonempty. This buys back the performance lost
in examples like Mario Weilguni's.
Tags:
----
REL8_1_STABLE
Modified Files:
--------------
pgsql/src/backend/executor:
nodeHashjoin.c (r1.75.2.2 -> r1.75.2.3)
(http://developer.postgresql.org/cvsweb.cgi/pgsql/src/backend/executor/nodeHashjoin.c.diff?r1=1.75.2.2&r2=1.75.2.3)
pgsql/src/include/nodes:
execnodes.h (r1.139.2.2 -> r1.139.2.3)
(http://developer.postgresql.org/cvsweb.cgi/pgsql/src/include/nodes/execnodes.h.diff?r1=1.139.2.2&r2=1.139.2.3)
---------------------------(end of broadcast)---------------------------
TIP 1: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get through to the mailing list cleanly
