| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332259 | Journal of Algorithms | 2005 | 18 Pages |
Abstract
We introduce a new sublinear space data structure-the count-min sketch-for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition, it can be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc. The time and space bounds we show for using the CM sketch to solve these problems significantly improve those previously known-typically from 1/ε2 to 1/ε in factor.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Graham Cormode, S. Muthukrishnan,