com.twitter.algebird
The Count-Min sketch uses pairwise independent hash functions drawn from a universal hashing family of the form
h(x) = [a * x + b (mod p)] (mod m)
Returns a * x + b (mod p) (mod width)
The Count-Min sketch uses pairwise independent hash functions drawn from a universal hashing family of the form
h(x) = [a * x + b (mod p)] (mod m)