An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- What's hot and what's notPublished by Association for Computing Machinery (ACM) ,2003
- One-pass wavelet decompositions of data streamsIEEE Transactions on Knowledge and Data Engineering, 2003
- Finding Frequent Items in Data StreamsLecture Notes in Computer Science, 2002
- Models and issues in data stream systemsPublished by Association for Computing Machinery (ACM) ,2002
- Fast, small-space algorithms for approximate histogram maintenancePublished by Association for Computing Machinery (ACM) ,2002
- Tracking join and self-join sizes in limited storagePublished by Association for Computing Machinery (ACM) ,1999
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- The space complexity of approximating the frequency momentsPublished by Association for Computing Machinery (ACM) ,1996
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985