Probabilistic Structures

1. Bloom filters may have:

false positives false negatives both neither

2. Two main parameters that control a bloom filter are:

3. Adding an element to a bloom filter does what?

Sets k bits derived from hashes Clears k bits Rebuilds the table Sorts the input

4. If any queried bit is 0, the element is:

5. Bloom filters trade accuracy for:

memory efficiency slower queries exact membership sorting