Streaming algorithms via precision sampling

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

Volumn , Issue , 2011, Pages 363-372

  Andoni, Alexandr ^a   Krauthgamer, Robert ^b   Onak, Krzysztof ^c  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

cascaded norms; moments; sampling; streaming

Indexed keywords

CASCADED NORMS; ESTIMATION ALGORITHM; HEAVY-HITTER; INPUT VECTOR; LINEAR FUNCTIONS; MOMENTS; PROBABILISTIC METHODS; RANDOM VECTORS; STREAMING ALGORITHM; WEAK ESTIMATES;

ACOUSTIC STREAMING; ALGORITHMS; COMPUTER SCIENCE; SAMPLING; VECTORS;

ESTIMATION;

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

References (32)

1. N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," J. Comp. Sys. Sci., vol. 58, pp. 137-147, 1999, previously appeared in STOC'96.
2. A. Andoni, K. Do Ba, P. Indyk, and D. Woodruff, "Efficient sketches for Earth-Mover Distance, with applications," in Proc. of FOCS, 2009.
3. A. Andoni, R. Krauthgamer, and K. Onak, "Polylogarithmic approximation for edit distance and the asymmetric query complexity," in Proc. of FOCS, 2010, a full version is available at http://arxiv.org/abs/1005. 4033.
4. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, "An information statistics approach to data stream and communication complexity," J. Comput. Syst. Sci., vol. 68, no. 4, pp. 702-732, 2004.
5. L. Bhuvanagiri and S. Ganguly, "Estimating entropy over data streams," in Proc. of ESA, 2006, pp. 148-159.
6. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha, "Simpler algorithm for estimating frequency moments of data streams,"in Proc. of SODA, 2006, pp. 708-713.
7. V. Braverman and R. Ostrovsky, "Measuring independence of datasets," in Proc. of STOC, 2010.
8. -, "Recursive sketching for frequency moments," CoRR, vol. abs/1011.2571, 2010.
9. -, "Zero-one frequency laws," in Proc. of STOC, 2010.
10. A. Chakrabarti, S. Khot, and X. Sun, "Near-optimal lower bounds on the multi-party communication complexity of set disjointness," in IEEE Conference on Computational Complexity, 2003, pp. 107-117.
11. M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams," in Proc. of ICALP, 2002.
12. E. Cohen, N. G. Duffield, H. Kaplan, C. Lund, and M. Thorup, "Stream sampling for variance-optimal estimation of subset sums," in Proc. of SODA, 2009, pp. 1255-1264.
13. G. Cormode and M. Muthukrishnan, "Count-min sketch," 2010, https://sites.google.com/site/countminsketch.
14. G. Cormode and S. Muthukrishnan, "An improved data stream summary: the count-min sketch and its applications," J. Algorithms, vol. 55, no. 1, pp. 58-75, 2005. (Pubitemid 40357145)
15. -, "Space efficient mining of multigraph streams," in Proc. of PODS, 2005.
16. N. G. Duffield, C. Lund, and M. Thorup, "Priority sampling for estimation of arbitrary subset sums," J. ACM, vol. 54, no. 6, 2007.
17. S. Ganguly, "Personal communication," April 2011.
18. S. Ganguly, M. Bansal, and S. Dube, "Estimating hybrid frequency moments of data streams," in Frontiers in Algorithmics, 2008.
19. S. Ganguly and G. Cormode, "On estimating frequency moments of data streams," in Proc. of RANDOM, 2007.
20. P. Indyk, "Stable distributions, pseudorandom generators, embeddings and data stream computation," J. ACM, vol. 53, no. 3, pp. 307-323, 2006, previously appeared in FOCS'00.
21. P. Indyk and D. Woodruff, "Optimal approximations of the frequency moments of data streams," Proc. of STOC, 2005.
22. S. Ioffe, "Improved consistent sampling, weighted minhash and L1 sketching," in International Conference on Data Mining, 2010.
23. T. Jayram and D. Woodruff, "The data stream space complexity of cascaded norms," in Proc. of FOCS, 2009.
24. p samplers, finding duplicates in streams, and related problems,"CoRR, vol. abs/1012.4889, 2010.
25. D. M. Kane, J. Nelson, E. Porat, and D. P. Woodruff, "Fast moment estimation in data streams in optimal space," in Proc. of STOC, 2011.
26. D. M. Kane, J. Nelson, and D. P. Woodruff, "On the exact space complexity of sketching small norms," in Proc. of SODA, 2010.
27. p (0 < p ≤ 2) using stable random projections," in Proc. of SODA, 2008.
28. J. Misra and D. Gries, "Finding repeated elements," Sci. Comput. Program., vol. 2, no. 2, pp. 143-152, 1982.
29. p-sampling with applications," in Proc. of SODA, 2010.
30. M. Muthukrishnan, Data Streams: Algorithms and Aplications, ser. Foundations and Trends in Theoretical Computer Science. Now Publishers Inc, Jan. 2005.
31. J. Nelson and D. Woodruff, "Fast Manhattan sketches in data streams," in Proc. of PODS, 2010.
32. M. Szegedy, "The DLT priority sampling is essentially optimal,"in Proc. of STOC, 2006, pp. 150-158.