On the value of multiple read/write streams for approximating frequency moments

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 499-508

  Beame, Paul ^a   Huynh Ngoc, Dang Trinh ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; DATA STREAM MODELS; DATA STREAMS; DETERMINISTIC ALGORITHMS; FIXED NUMBERS; HIGHER FREQUENCIES; INPUT DATUMS; INPUT SEQUENCES; LOWER BOUNDS;

APPROXIMATION ALGORITHMS; COMPUTERS; CONTROL THEORY; DATA MINING; FIBER OPTIC CHEMICAL SENSORS; POLYNOMIAL APPROXIMATION;

MATHEMATICAL MODELS;

EID: 57949107170     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.52     Document Type: Conference Paper

References (16)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Sys. Sci., 58(1):137-147, 1999.
2. B. Babcock, S. Babu, M. Datar, M. R, and J. Widom. Models and issues in data stream systems. In Proc. 21st ACMPODS, pages 1-16, 2002.
3. Z. Bar-Yossef, T. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Sys. Sci., 68(4):702-732, 2004.
4. P. Beame, E. Blais, and D.-T. Huynh-Ngoc. Longest common subsequences in sets of permutations. In preparation.
5. P. Beame, T. S. Jayram, and A. Rudra. Lower bounds for randomized read/write stream algorithms. In Proc. 39th ACM STOC, pages 689-698, 2007.
6. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha. Simpler algorithms for estimating frequency moments of data streams. In Proc. Seventeenth ACM-SIAM SODA, pages 708-713, 2006.
7. A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In Eighteenth IEEE Conference on Computational Complexity, pages 107-117, 2003.
8. M. Grohe, A. Hernich, and N. Schweikardt. Randomized computations on large data sets: Tight lower bounds. In Proc. 25th ACM PODS, pages 243-252, 2006.
9. M. Grohe and N. Schweikardt. Lower bounds for sorting with few random accesses to external memory. In Proc. 24th ACM PODS, pages 238-249, 2005.
10. P. Indyk and D. P. Woodruff. Tight lower bounds for the distinct elements problem. In Proc. 44th IEEE FOCS, pages 283-292, 2003.
11. P. Indyk and D. P. Woodruff. Optimal approximations of frequency moments of data streams. In Proc. 37th ACM STOC, pages 202-208, 2005.
12. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical. Computer Science, 1(2), 2006.
13. A. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106(2):385-390, 1992.
14. M. E. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proc. 34th ACM STOC, pages 360-369, 2002.
15. J. M. Steele. Variations on the monotone subsequence problem of Erdös and Szekeres. In Aldous, Diaconis, and Steele, editors, Discrete Probability and Algorithms, pages 111-132. Springer-Verlag, 1995.
16. D. P. Woodruff. Optimal space lower bounds for all frequency moments. In Proc. Fifteenth ACM-SIAM SODA, pages 167-175, 2004.