1
3.6kviews
Suppose a data stream consists of the integers 1,3,2,1,2,3,4,3,1,2,3,1.Let the hash function being used is h(x) = (6x+1) mod 5; estimate the number of distinct in this stream using FM algorithm.
1 Answer
0
964views
Data h(x) = 6x+1 mod 5 Reminder Binary bit-String Tail Length
1 h(x) = 6 (1) +1 mod 5 2 010 1
3 h(x) = 6 (3) +1 mod 5 4 100 2
2 h(x) = 6 (2) +1 mod 5 3 011 0
1 h(x) = 6 (1) +1 …

Create a free account to keep reading this post.

and 4 others joined a min ago.

Please log in to add an answer.