It talks about bloom filters for hash joins in PostgreSQL specifically. Interestingly, they talk about specific TPC-H queries.
Interesting. The way that paper uses bloom filters is very different from what I do in the patch. They build the bloom filters and then propagate them into the scan nodes to eliminate the tuples early.
That does sound interesting, but unless I'm somehow mistaken, I guess to do that you'd have to abandon the more efficient hashing of the hash value that you're doing in the current patch, and hash the complete value in the scan node, then hash them again if they make it into the hash join node. That does not sound like it would be a win if hashing longer varlana values.
