Optimal approximations of the frequency moments of data streams

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 202-208

  Indyk, Piotr ^a   Woodruff, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Frequency moments; Streaming algorithms

Indexed keywords

FREQUENCY MOMENTS; SPACE ALGORITHMS; STREAMING ALGORITHMS;

ALGORITHMS; DATA REDUCTION; FREQUENCIES; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

APPROXIMATION THEORY;

EID: 33244491819     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060621     Document Type: Conference Paper

References (17)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proceedings of the 28th Annual ACM Symposum on the Theory of Computing (STOC), pages 20-29, 1996.
2. Also; J. Comp. Sys. Sci. 58, pages 137-147, 1999.
3. Z. Bar Yossef, T.S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS), pages 209-218, 2002.
4. Z. Bar Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, and Luca Trevisan. Counting distinct elements in a data stream. RANDOM 2002, 6th. International Workshop on Randomization and Approximation Techniques in Computer Science, p. 1-10, 2002.
5. A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multiparty communication complexity of set-disjointness. In Proceedings of the 18th IEEE Conference on Computational Complexity (CCC), pages 107-117, 2003.
6. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Theor. Comput. Sci. 312(1), pages 3-15, 2004
7. (Extended Abstract appeared in Proceedings of the 29th International Colloquium on Automata Languages and Programming (ICALP), 2002).
8. D. Coppersmith and R. Kumar, An improved data stream algorithm for frequency moments. In Proc of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 151-156, 2004.
9. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An Approximate Li-Difference Algorithm for Massive Data Streams. In SIAM Journal on Computing 32, pages 131-151, 2002
10. (Extended Abstract appeared in Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), 1999).
11. S. Ganguly. Estimating Frequency Moments of Data Streams using Random Linear Combinations. In RANDOM, 2004.
12. S. Ganguly. A Hybrid Technique for Estimating Frequency Moments over Data Streams. Unpublished Manuscript, 2004.
13. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Journal of the ACM, to appear.
14. Preliminary version in Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS), pages 187-197, 2000.
15. P. Indyk. A Small Approximately Min-Wise Independent Family of Hash Functions. In Journal of Algorithms 38, 2001.
16. 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.
17. M. Thorup and Y. Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In Proc of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 615-624, 2004.