Finding frequent items in data streams
Top Cited Papers
- 1 January 2004
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 312 (1) , 3-15
- https://doi.org/10.1016/s0304-3975(03)00400-6
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A simple algorithm for finding frequent elements in streams and bagsACM Transactions on Database Systems, 2003
- Clustering data streamsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Stable distributions, pseudorandom generators, embeddings and data stream computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximate Frequency Counts over Data StreamsPublished by Elsevier ,2002
- Fast, small-space algorithms for approximate histogram maintenancePublished by Association for Computing Machinery (ACM) ,2002
- Space lower bounds for distance approximation in the data stream modelPublished 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