Why are bloom filters not implemented like count-min sketch?

Question

So I only recently learned about these, but from what I understood counting bloom filters are very similar to count-min sketches. The difference being that the former use a single array for all hash functions and the latter use an array per hash function.

If using separate arrays for each hash function will result in less collisions and reduce false positives, why are counting bloom filters not implemented as such?

user_5167682 · Answer

Though both are space-efficient probabilistic data structures, BloomFilter and Count-min-sketch solve diff use-cases.

BloomFilter is used to test whether an element is a member of a set or not. and It gives boolean False positive results. False positive means, it might tell that a given element is already present but actually, it’s not. See here for working details: https://www.geeksforgeeks.org/bloom-filters-introduction-and-python-implementation/
Count-min-sketch tells about keeping track of the count of things i.e, How many times an element is present in a set. See here for working details: https://www.geeksforgeeks.org/count-min-sketch-in-java-with-examples/

Why are bloom filters not implemented like count-min sketch?

1 Answers