Count-Min Sketch
Counting the frequency of a value X within a multiset.
Like Bloom Filters, we have a vector-length and independent hashes.
- Unlike Bloom Filters, each hash has its own int-vector of bits!
Putting the first x
Putting another x
Counting the frequency of a value X within a multiset.
Like Bloom Filters, we have a vector-length and independent hashes.
Putting the first x
Putting another x