Finding Frequent Items in Data Streams
Top Cited Papers
- 25 June 2002
- book chapter
- Published by Springer Nature
- p. 693-703
- https://doi.org/10.1007/3-540-45465-9_59
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An approximate L/sup 1/-difference algorithm for massive data streamsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Stable distributions, pseudorandom generators, embeddings and data stream computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast, small-space algorithms for approximate histogram maintenancePublished by Association for Computing Machinery (ACM) ,2002
- Database-friendly random projectionsPublished by Association for Computing Machinery (ACM) ,2001
- Synopsis data structures for massive data setsPublished by American Mathematical Society (AMS) ,1999
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- New sampling-based summary statistics for improving approximate query answersPublished by Association for Computing Machinery (ACM) ,1998