Fortunately, the solution lies in applying another kind of summarization algorithms for frequent items mining, the so called counter based algorithms [1]}, [2]}. In this family of algorithms the sketch consists of an explicitly maintained list of frequent items candidates. For a sufficiently large yet compact sketch the heavy hitter is guaranteed to be detected. Next we obtain theoretical results for the approach.
