Counting Distinct Elements in a Data Stream
- 23 August 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Estimating simple functions on the union of data streamsPublished by Association for Computing Machinery (ACM) ,2001
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- Size-Estimation Framework with Applications to Transitive Closure and ReachabilityJournal of Computer and System Sciences, 1997
- Selectivity and Cost Estimation for Joins Based on Random SamplingJournal of Computer and System Sciences, 1996
- A linear-time probabilistic counting algorithm for database applicationsACM Transactions on Database Systems, 1990
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979