Which Hash functions can be used in count-min sketch?

669 Views Asked by At

The number of elements in my set are over a billion 230. I intent to count the occurrence of each element in the set. For this purpose, I want to use count-min sketch. Please suggest how the hash functions should be chosen. The false positive rate of at most 5% is tolerable for my application.

1

There are 1 best solutions below

0
xmerge On

Count-Min Sketch requires 2-wise independent hash functions, but in practice, I strongly recommend MurmurHash. It is fast and robust, works perfectly well for Count-Min Sketch.