Counting distinct items over update streams

Theoretical Computer Science

Volumn 378, Issue 3, 2007, Pages 211-222

  Ganguly, Sumit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Data stream; Distinct items; Negative dependence; Online algorithm; Randomized algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR SYSTEMS; ONLINE SYSTEMS;

DATA STREAM; DISTINCT ITEMS; NEGATIVE DEPENDENCE; ONLINE ALGORITHM; RANDOMIZED ALGORITHM;

DATA PROCESSING;

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

References (17)

1. Noga Alon, Yossi Matias, Mario Szegedy, The space complexity of approximating the frequency moments, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, STOC, Philadelphia, Pennsylvania, May 1996, pp. 20-29
2. Alon N., Matias Y., and Szegedy M. The space complexity of approximating frequency moments. Journal of Computer Systems and Sciences 58 1 (1998) 137-147
3. Ziv Bar-Yossef, T.S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan, Counting distinct elements in a data stream, in: Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2002, Cambridge, MA, 2002
4. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher, Min-wise independent permutations (Extended Abstract), in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing STOC, Dallas, Texas, May 1998, pp. 327-336
5. Broder A.Z., Charikar M., Frieze A.M., and Mitzenmacher M. Min-wise independent permutations. Journal of Computer Systems and Sciences 60 3 (2000) 630-659
6. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan, Comparing data streams using Hamming norms, in: Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, August 2002
7. Dubhashi D.P., and Ranjan D. Balls and bins: A study in negative dependence. Random Structures Algorithms 13 2 (1998) 99-124
8. Flajolet P., and Nigel Martin G. Probabilistic counting algorithms for database applications. Journal of Computer Systems and Sciences 31 2 (1985) 182-209
9. Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi, Processing set expressions over continuous update streams, in: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA, 2003
10. Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi, Krishna Sabnani, Streaming Algorithms for robust, real-time detection of DDoS Attacks. Bell Laboratories Technical Memorandum, 2004
11. Philip B. Gibbons, Distinct sampling for highly-accurate answers to distinct values queries and event reports, in: Proceedings of the 27th International Conference on Very Large Data Bases, Roma, Italy, September 2001
12. Philip B. Gibbons, Srikant Tirthapura, Estimating simple functions on the union of data streams, in: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete, Greece, July 2001, pp. 281-291
13. Philip B. Gibbons, Srikant Tirthapura, Distributed streams algorithms for sliding windows, in: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 2002, pp. 63-72
14. Piotr Indyk, David Woodruff, Tight lower bounds for the distinct elements problem, in: Proceedings of the 35th ACM Symposium on Theory of Computing, STOC, 2003, San Diego, CA, 2003
15. Noam Nisan, Pseudo-random generators for space bounded computation, in: Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, STOC, 1990
16. Jeanette Schmidt, Alan Siegel, Aravind Srinivasan, Chernoff-Hoeffding bounds with applications for limited independence, in: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 331-340
17. Wegman M.N., and Lawrence Carter J. New hash functions and their use in authentication and set equality. Journal of Computer Systems and Sciences 22 (1981) 265-279