A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
[chapter]
2004
Lecture Notes in Computer Science
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
doi:10.1007/978-3-540-24698-5_7
fatcat:dlavnb57wnceldrliwpp6ywroa