Count-Min Sketch [1] is a widely adopted algorithm for approximate event counting in large scale processing. However, the original version of the Count-Min-Sketch (CMS) suffers of some deficiences, especially if one is interested by the low-frequency items, as in text-mining related tasks. Several variants of CMS [5] have been proposed to compensate for the high relative error for low-frequency events, but the proposed solutions tend to correct the errors instead of preventing them. In this paper, we propose the CountMin-Log sketch, which uses logarithm-based, approximate counters [7, 4] instead of linear counters to improve the average relative error of CMS (with conservative update) at constant memory footprint.
CML-sketch is another variant of the CM-sketch that uses logarithm-based approximate counters instead of linear counters REF .
Count-Min-Log sketch: Approximately counting with approximate counters
ArXiv
ArXiv
Computer Science