Question: This question is about using the count-min sketch to estimate the frequencies of elements in a stream. The elements in the stream come from the

This question is about using the count-min sketch to estimate the frequencies of elements in a stream. The elements in the stream come from the range [0,9]. The count-min sketch maintains a two-dimensional array C[0..k - 10..l - 1]. (For convenience, we let the array indices run over the ranges [0, k - 1] and [0,2 - 1] instead of [1, k]| and [1,2 as given in the lecture notes Use k 2 and l 3. So there are two hash functions hr for r E [0, k - 1] - [0,1]. Use the following hash functions: ho(x)(2x+1) mod 3 hi(x) 2) mod 3 That is, given an element a in the stream, we map r to the array entries C[O, ho(x)] and C[1, hi (x)]. Run the count-min sketch algorithm on the following stream (read from left to right): 5, 6, 5,0, 4,9, 0, 0,8,7,3,1,2,3,3,2,1,1,2,6, 5,7,8, 9, 0,2,5,1,7, 8,3, 2, 2, 6, 6,8,9, 0,9,4,1, 2 Draw the final array C to show the values of its entries after processing all elements in the stream above. Use the count-min sketch to give the estimates fa of the frequency of a in the stream for all a E [0.9]. You do not need to show any intermediate step. This question is about using the count-min sketch to estimate the frequencies of elements in a stream. The elements in the stream come from the range [0,9]. The count-min sketch maintains a two-dimensional array C[0..k - 10..l - 1]. (For convenience, we let the array indices run over the ranges [0, k - 1] and [0,2 - 1] instead of [1, k]| and [1,2 as given in the lecture notes Use k 2 and l 3. So there are two hash functions hr for r E [0, k - 1] - [0,1]. Use the following hash functions: ho(x)(2x+1) mod 3 hi(x) 2) mod 3 That is, given an element a in the stream, we map r to the array entries C[O, ho(x)] and C[1, hi (x)]. Run the count-min sketch algorithm on the following stream (read from left to right): 5, 6, 5,0, 4,9, 0, 0,8,7,3,1,2,3,3,2,1,1,2,6, 5,7,8, 9, 0,2,5,1,7, 8,3, 2, 2, 6, 6,8,9, 0,9,4,1, 2 Draw the final array C to show the values of its entries after processing all elements in the stream above. Use the count-min sketch to give the estimates fa of the frequency of a in the stream for all a E [0.9]. You do not need to show any intermediate step
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
