Explain 'Bloom Filter' union and intersection.

Explain 'Bloom Filter' union and intersection.

Approach: Describe how bitwise operations can combine Bloom filters.

Two Bloom filters with the same size and hash functions can be combined. A union is a bitwise OR of their bit arrays. An intersection is more complex, but a bitwise AND provides a filter for the intersection (though the false positive rate may increase).

Follow-up: Can you delete elements from a standard Bloom filter?

Key concepts: bitwise OR, bitwise AND, parameters.