The cost to form the inner hash is basically negligible whether it's
de-duped or not, but if it's not (known) de-duped then the cost
estimate for the semijoin is going to rise some, and that discourages
selecting it.
Why does the "hash semi join" care about duplication of values on the inner relation? Doesn't it only care whether a given bucket exists irrespective of its contents?
Looking at those explains it would seem the "hash semi join" is simply an inherently more expensive to execute compared to a "hash join" and that the act of de-duping the inner relation would have to be quite expensive to overcome the gap. I cannot reconcile this with the previous paragraph though...
Pointing me to the readme or code file (comments) that explains this in more detail would be welcome. Not sure what to grep for - "Hash Semi Join" only turns up a couple of expected output results...
Thx.
David J.
