Tight bounds for Lp samplers, finding duplicates in streams, and related problems

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2011, Pages 49-58

  Jowhari, Hossein ^a   Sǎglam, Mert ^a   Tardos, Gábor ^a,b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

Finding duplicates; Sampling; Streaming algorithms

Indexed keywords

ALPHABET SIZE; COMMUNICATION COMPLEXITY; CONSTANT FAILURE RATE; DATA STREAM; FINDING DUPLICATES; HEAVY-HITTER; LOWER BOUNDS; RELATIVE ERRORS; SAMPLING ALGORITHM; SPACE ALGORITHMS; SPACE BOUNDS; STREAMING ALGORITHMS; TIGHT BOUND; UPPER BOUND;

ALGORITHMS; DATABASE SYSTEMS;

COMMUNICATION;

EID: 79960182864     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989284.1989289     Document Type: Conference Paper

References (29)

1. Alex Andoni, Robert Krauthgamer, and Krzysztof Onak. Streaming algorithms via precision sampling. Manuscript, 2010.
2. Khanh Do Ba, Piotr Indyk, Eric Price, and David P. Woodruff. Lower bounds for sparse recovery. In SODA, pages 1190-1197, 2010.
3. Brian Babcock, Mayur Datar, and Rajeev Motwani. Sampling from a moving window over streaming data. In SODA, pages 633-634, 2002.
4. Radu Berinde, Graham Cormode, Piotr Indyk, and Martin J. Strauss. Space-optimal heavy hitters with strong error bounds. In PODS, pages 157-166, 2009.
5. Vladimir Braverman, Rafail Ostrovsky, and Carlo Zaniolo. Optimal sampling from sliding windows. In PODS, pages 147-156, 2009.
6. Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. Theor. Comput. Sci., 312(1):3-15, 2004.
7. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, and Mikkel Thorup. Stream sampling for variance-optimal estimation of subset sums. In SODA, pages 1255-1264, 2009.
8. Graham Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1):58-75, 2005. (Pubitemid 40357145)
9. Graham Cormode, S. Muthukrishnan, and Irina Rozenbaum. Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In VLDB, pages 25-36, 2005. (Pubitemid 43990990)
10. Graham Cormode, S. Muthukrishnan, Ke Yi, and Qin Zhang. Optimal sampling from distributed streams. In PODS, pages 77-86, 2010.
11. Nick G. Duffield, Carsten Lund, and Mikkel Thorup. Priority sampling for estimation of arbitrary subset sums. J. ACM, 54(6), 2007.
12. Gereon Frahling, Piotr Indyk, and Christian Sohler. Sampling in dynamic data streams and applications. In Proceedings of the twenty-first annual symposium on Computational geometry, SCG'05, pages 142-149, New York, NY, USA, 2005. ACM. (Pubitemid 43283455)
13. Anna Gilbert and Piotr Indyk. Sparse recovery using sparse matrices. In Proceeding of IEEE, 2010.
14. Parikshit Gopalan and Jaikumar Radhakrishnan. Finding duplicates in a data stream. In Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'09, pages 402-411, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
15. T. S. Jayram and David P. Woodruff. The data stream space complexity of cascaded norms. In FOCS, pages 765-774, 2009.
16. Daniel M. Kane, Jelani Nelson, Ely Porat, and Woodruff David P. Fast moment estimation in data streams in optimal space. Manuscript, 2010.
17. Daniel M. Kane, Jelani Nelson, and David P. Woodruff. On the exact space complexity of sketching and streaming small norms. In SODA, pages 1161-1178, 2010.
18. Daniel M. Kane, Jelani Nelson, and David P. Woodruff. An optimal algorithm for the distinct elements problem. In Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, PODS'10, pages 41-52, New York, NY, USA, 2010. ACM.
19. Mauricio Karchmer. A New Approach to Circuit Depth. PhD thesis, MIT, 1989.
20. Mauricio Karchmer and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth. In Proceedings of the twentieth annual ACM symposium on Theory of computing, STOC'88, pages 539-550, New York, NY, USA, 1988. ACM.
21. Donald E. Knuth. The Art of Computer Programming, Volume II: Seminumerical Algorithms. Addison-Wesley, 1969.
22. Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Duplicate detection in click streams. In WWW, pages 12-21, 2005.
23. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, STOC'95, pages 103-111, New York, NY, USA, 1995. ACM.
24. Morteza Monemizadeh and David P. Woodruff. 1-pass relative-error lp-sampling with applications. In SODA, pages 1143-1160, 2010.
25. S. Muthukrishnan. Data Streams: Algorithms and Applications.
26. N. Nisan. Pseudorandom generators for space-bounded computations. In Proceedings of the twenty-second annual ACM symposium on Theory of computing, STOC'90, pages 204-212, New York, NY, USA, 1990. ACM.
27. Gabor Tardos and Uri Zwick. The communication complexity of the universal relation. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity, pages 247{, Washington, DC, USA, 1997. IEEE Computer Society.
28. Jun Tarui. Finding a duplicate and a missing item in a stream. In Jin-Yi Cai, S. Cooper, and Hong Zhu, editors, Theory and Applications of Models of Computation, volume 4484 of Lecture Notes in Computer Science, pages 128-135. Springer Berlin/Heidelberg, 2007. (Pubitemid 47628394)
29. David Woodruff and T. S. Jayram. Optimal bounds for johnson-lindenstrauss transforms and streaming problems with low error. In SODA, 2011.