Two improved range-efficient algorithms for F0 estimation

Theoretical Computer Science

Volumn 410, Issue 11, 2009, Pages 1073-1080

  Sun, He ^a   Poon, Chung Keung ^b  

^a FUDAN UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Data streams; Distinct elements; F0 norm; Range efficiency

Indexed keywords

DATA STREAMS; DISTINCT ELEMENTS; EFFICIENT ALGORITHMS; F0 NORM; RANGE-EFFICIENCY;

EID: 59649111446     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.10.031     Document Type: Article

References (14)

1. Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences 58 (1999) 137-147
2. Z. Bar-Yossef, R. Kumar, D. Sivakumar, Reductions in streaming algorithms, with an application to counting triangles in graphs, in: Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 623-632
3. Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, L. Trevisan, Counting distinct elements in a data stream, in: Proceedings of 6th International Workshop on Randomization and Approximation Techniques in Computer Science, 2002, pp. 1-10
4. G. Cormode, M. Datar, P. Indyk, S. Muthukrishnan, Comparing data streams using hamming norms (How to zero in), in: Proceedings of the 28th International Conference on Very Large Data Bases, 2002, pp. 335-345
5. G. Cormode, S. Muthukrishnan, Estimating dominance norms of multiple data streams, in: Proceedings of the 11th European Symposium on Algorithms, 2003, pp. 148-160
6. G. Cormode, Stable distributions for stream computations: It's as easy as 0, 1, 2, in: Workshop on Management and Processing of Massive Data Streams, at FCRC, 2003
7. M. Durand, P. Flajolet, Loglog counting of large cardinalities, in: Proceedings of the European Symposium on Algorithms, 2003, pp. 605-617
8. Flajolet P., and Martin G.N. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31 (1985) 182-209
9. Ganguly S., Garofalakis M., and Rastogi R. Tracking set-expression cardinalities over continuous update streams. The International Journal on Very Large Data Bases 13 (2004) 354-369
10. P.B. Gibbons, S. Tirthapura, Estimating simple functions on the union of data streams, in: Proceedings of Symposium on Parallel Algorithms and Architectures, 2001, pp. 281-291
11. Giroire F. Order statistics and estimating cardinalities of massive data sets. Discrete Mathematics and Theoretical Computer Science AD (2005) 157-166
12. S. Muthukrishnan, Data streams: Algorithms and applications, Invited talk at 14th ACM-SIAM Symposium on Discrete Algorithms. Available from: http://athos.rutgers.edu/~muthu/stream-1-1.ps
13. 0 over massive data stream, in: Proceedings of the 21st International Conference on Data Engineering, 2005, pp. 32-43
14. Wegman M.N., and Carter J.L. New hash functions and their use in authentication and set equality. Journal of Computer and System Science 22 (1981) 265-279