DMCA
An improved data stream summary: The Count-Min sketch and its applications (2004)
Cached
Download Links
- [dimacs.rutgers.edu]
- [www.research.att.com]
- [www.cse.unsw.edu.au]
- [dimacs.rutgers.edu]
- [db.cs.berkeley.edu]
- [madalgo.au.dk]
- [www.madalgo.au.dk]
- [www.madalgo.au.dk]
- [www.eecs.harvard.edu]
- [www.cc.gatech.edu]
- [www.research.att.com]
- [dimacs.rutgers.edu]
- [people.cs.umass.edu]
- [cse.seu.edu.cn]
- [www.dblab.ntua.gr]
- DBLP
Other Repositories/Bibliography
| Venue: | J. Algorithms |
| Citations: | 413 - 43 self |
BibTeX
@ARTICLE{Cormode04animproved,
author = {Graham Cormode and S. Muthukrishnan},
title = {An improved data stream summary: The Count-Min sketch and its applications},
journal = {J. Algorithms},
year = {2004},
volume = {55},
pages = {29--38}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. 1
