Analyzing Count Min Sketch with Conservative Updates - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Networks Year : 2022

Analyzing Count Min Sketch with Conservative Updates


Count-Min Sketch with Conservative Updates (CMS-CU) is a popular algorithm to approximately count items’ appearances in a data stream. Despite CMS-CU’s widespread adoption, the theoretical analysis of its performance is still wanting because of its inherent difficulty. In this paper, we propose a novel approach to study CMS-CU and derive new upper bounds on both the expected value and the CCDF of the estimation error under an i.i.d. request process. Our formulas can be successfully employed to derive improved estimates for the precision of heavy-hitter detection methods and improved configuration rules for CMS-CU. The bounds are evaluated both on synthetic and real traces.
Embargoed file
Embargoed file
0 11 11
Year Month Jours
Avant la publication

Dates and versions

hal-03764212 , version 1 (15-09-2022)



Younes Ben Mazziane, Sara Alouf, Giovanni Neglia. Analyzing Count Min Sketch with Conservative Updates. Computer Networks, 2022, 217, pp.109315. ⟨10.1016/j.comnet.2022.109315⟩. ⟨hal-03764212⟩
56 View
4 Download



Gmail Facebook Twitter LinkedIn More