What is 'Bloom Filter' union property?

What is 'Bloom Filter' union property?

Approach: Explain how two filters can be merged.

The bitwise OR of two Bloom filters results in a Bloom filter that represents the union of the two sets. This only works if the filters have the same size and hash functions.

Follow-up: Is this a lossless union?

Key concepts: bitwise OR, lossless, identical parameters.