论文信息 - Counting Distinct Elements in a Data Stream

Counting Distinct Elements in a Data Stream

We present three algorithms to count the number of distinct elements in a data stream to within a factor of 1 ± ?. Our algorithms improve upon known algorithms for this problem, and offer a spectrum of time/space tradeoffs.

[1] Larry Carter,et al. Universal classes of hash functions (Extended Abstract) , 1977, STOC '77.

[2] Larry Carter,et al. New classes and applications of hash functions , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[4] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[5] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[6] Kyu-Young Whang,et al. A linear-time probabilistic counting algorithm for database applications , 1990, TODS.

[7] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.

[8] Jeffrey F. Naughton,et al. Selectivity and Cost Estimation for Joins Based on Random Sampling , 1996, J. Comput. Syst. Sci..

[9] Edith Cohen,et al. Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..

[10] Srikanta Tirthapura,et al. Estimating simple functions on the union of data streams , 2001, SPAA '01.

[11] Ziv Bar-Yossef,et al. Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.