> 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 union differently. Intersections, however, behave well. There is a similar problem, among others, with expanding smaller filters to match larger ones. David Hudson
