Question

1

4.4kviews

Suppose a data stream consists of the integers 3, 1, 4, 1, 5, 9, 2, 6, 5. Let the hash function being used is h(x) = 3x + 1 mod 5;

written 5.1 years ago by

swatisharma • 1.3k

modified 2.5 years ago by

binitamayekar ★ 6.4k

Show how the Flajolet- Martin Algorithm will estimate the number of distinct element in this stream

ADD COMMENT EDIT

1 Answer

x	h(x)	Rem	Binary	r(a)
3	10	0	000	3
1	4	4	100	2
4	13	3	011	0
1	4	4	100	2
5	16	1	001	0
9	28 …

Create a free account to keep reading this post.