⋮

Bloom Filter

All changes saved Not started

Choose the policy you would defend in a design review. Choices save as you go.

1.What does a positive membership response mean?

The key is certainly storedThe key may have been insertedThe filter contains the original bytes

2.When may filters be merged using bitwise OR?

Whenever their byte lengths matchWhenever both are nonemptyOnly when bit count, hashes, seed and encoding are compatible

3.Why is clearing bits to delete unsafe?

Other inserted keys may share those bitsIt always increases memoryBits cannot be changed

Trade-offs, failure cases and tests

Explain a rejected alternative, a failure mode and how you would test the design. At least 80 characters for the completeness check.

0 characters