> Then your union operation is to just bitwise or the two bloomfilters.
Keep in mind that when performing this sort of union between two
comparably-sized sets, your false-positive rate will increase by about an order
of magnitude. You need to size your bloom filters accordingly, or perform the
Another idea of how to make use of bloom filters:
It should be possible to implement a gist opclass over a bloomfilter
data type which implements the operation int membership in int[].
All you need is a function which takes an int[] and returns a bloom
filter. Then your union operation is to just
