TY - GEN
T1 - A formal analysis of conservative update based approximate counting
AU - Einziger, Gil
AU - Friedman, Roy
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/3/26
Y1 - 2015/3/26
N2 - This paper presents a formal analysis of multiple popular approximate counting schemes that employ the conservative update policy, such as CU-Sketch and Minimal Increment Spectral Bloom Filters, under a unified framework. It is also shown that when applied to items picked from a skewed distribution, such as Zipf-like functions, the analysis follows very closely empirical results obtained through simulations. Furthermore, this paper's analysis is orders of magnitude more accurate than previously known analysis of approximate counting schemes.
AB - This paper presents a formal analysis of multiple popular approximate counting schemes that employ the conservative update policy, such as CU-Sketch and Minimal Increment Spectral Bloom Filters, under a unified framework. It is also shown that when applied to items picked from a skewed distribution, such as Zipf-like functions, the analysis follows very closely empirical results obtained through simulations. Furthermore, this paper's analysis is orders of magnitude more accurate than previously known analysis of approximate counting schemes.
UR - http://www.scopus.com/inward/record.url?scp=84928041729&partnerID=8YFLogxK
U2 - 10.1109/ICCNC.2015.7069350
DO - 10.1109/ICCNC.2015.7069350
M3 - Conference contribution
AN - SCOPUS:84928041729
T3 - 2015 International Conference on Computing, Networking and Communications, ICNC 2015
SP - 255
EP - 259
BT - 2015 International Conference on Computing, Networking and Communications, ICNC 2015
PB - Institute of Electrical and Electronics Engineers
T2 - 2015 International Conference on Computing, Networking and Communications, ICNC 2015
Y2 - 16 February 2015 through 19 February 2015
ER -