An improved data stream algorithm for frequency moments

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 144-149

  Coppersmith, Don ^a   Kumar, Ravi ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM ALGORITHMS; FREQUENCY MOMENTS;

ALGORITHMS; APPROXIMATION THEORY; DATA REDUCTION; FUNCTIONS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPUTATIONAL METHODS;

EID: 1842578279     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. [AMS99] N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
2. +02] B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 1-16, 2002.
3. +02] Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In Randomization and Approximation Techniques, 6th International Workshop (RANDOM), pages 1-10, 2002.
4. [BJKS02a] Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 209-218, 2002.
5. [BJKS02b] Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. Information theory methods in communication complexity. In Proc. of the 17th Annual IEEE Conference on Computational Complexity (CCC), pages 93-102, 2002.
6. [BKS01] Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Sampling algorithms: lower bounds and applications. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 266-275, 2001.
7. [BKS02] Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 623-632, 2002.
8. [CKS03] A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multiparty communication complexity of set-disjointness. In Proc. of the 18th Annual IEEE Conference on Computational Complexity (CCC), 2003.
9. [CW79] L. Carter and M. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, 1979.
10. 1-difference algorithm for massive data streams. SIAM Journal on Computing, 32:131-151, 2002.
11. [FM85] P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
12. [GT01] P. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In Proc. of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 281-291, 2001.
13. [HRR99] M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In DIMACS series in Discrete Mathematics and Theoretical Computer Science, volume 50, pages 107-118, 1999.
14. [Ind00] P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computations. In Proc. of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 189-197, 2000.
15. [IW03] P. Indyk and D. Woodruff. Tight lower bounds for the distinct elements problem. In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
16. [Mut03] S. Muthukrishnan, Data streams: algorithms and applications. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), page 413, 2003.
17. [SS02] M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 360-369, 2002.
18. [WC81] M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22(3):265-279, 1981.