The Count-Min sketch is an important and well-studied data summarization method. It can estimate the count of any item in a stream using a small, xed size data sketch. However, the accuracy of the Count-Min sketch depends on characteristics of the underlying data. This has led to a number of count estimation procedures which work well in one scenario but perform poorly in others. A practitioner is faced with two basic, unanswered questions. Given an estimate, what is its error? Which estimation procedure should be chosen when the data is unknown? We provide answers to these questions. We derive new count estimators, including a provably optimal estimator, which best or match previous estimators in all scenarios. We also provide practical, tight error bounds at query time for all estimators and methods to tune sketch parameters using these bounds. The key observation is that the full distribution of errors in each counter can be empirically estimated from the sketch itself. By rst estimating this distribution, count estimation becomes a statistical estimation and inference problem with a known error distribution. This provides both a principled way to derive new and optimal estimators as well as a way to study the error and properties of existing estimators.
Like the distinct counting results, REF provide a provably optimal estimator for the CountMin sketch.
Count-Min: Optimal Estimation and Tight Error Bounds using Empirical Error Distributions
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Computer Science Mathematics