functions with an array of m counters for each of them The Count-Min Sketch ??? Vasiliki Kalavri | Boston University 2020 21 The Count-Min Sketch m counters h1 h2 hp … p pairwise independent hash functions Kalavri | Boston University 2020 22 for j=1 to p do i = hj(x) ci,j++ Adding an element to the sketch stream elements x All counters are initialized to 0s 0 0 0 6 9 3 3 1 5 0 0 3 8 2 7 9 m counters to decide whether an element is popular • For every element x, we add it to the sketch and then use the updated sketch to estimate its frequency. Computing top-k ??? Vasiliki Kalavri | Boston University