Finding duplicates in a data stream

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 402-411

  Gopalan, Parikshit ^a   Radhakrishnan, Jaikumar ^b  

^a MICROSOFT RESEARCH   (United States)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM; HALF-SPACE; ISOLATION LEMMATA; LINEAR SPACES; ONE-PASS; POSITIVE FREQUENCIES; RANDOMIZED ALGORITHMS; SINGLE PASS;

ALGORITHMS;

EID: 70349155021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.45     Document Type: Conference Paper

References (17)

1. [AMS99] N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. JCSS, 58(1):137-147, 1999.
2. th ACM SIGKDD, pages 39-48, 2003.
3. [BNW03] A. Z. Broder, M. Najork, and J. L. Wiener. Efficient URL caching for world wide web crawling. In WWW, 2003.
4. [CG89] B. Chor and O. Goldreich. On the power of two-point based sampling. J. Complexity, 5(1):96-106, (1989).
5. [Cha08] M. Charikar. Top-k frequent item maintenance over streams. Survey article, 2008.
6. th IEEE Conference on Computational Complexity, pages 107-117, 2003.
7. [DR06] F. Deng and D. Rafiei. Approximately detecting duplicates for streaming data using stable Bloom filters. In SIGMOD Conference, pages 25-36, 2006. (Pubitemid 46946501)
8. th 2005.
9. st IEEE ICDE, 2005.
10. [Ind06] P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. J. ACM, 53(3):307-323, 2006. (Pubitemid 44180740)
11. [KN97] E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
12. [KS92] B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Math, 5(5):545-557, 1992.
13. [MAA05] A. Metwally, D. Agrawal, and A. El Abbadi. Duplicate detection in click streams. In WWW, pages 12-21, 2005.
14. [Mut05] S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers Inc., 2005.
15. [Nis92] N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
16. [Raz92] A. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106(2):385-390, 1992.
17. [Tar07] J. Tarui. Finding a duplicate and a missing item in a stream. In TAMC, pages 128-135, 2007. (Pubitemid 47628394)