Skip to main content
SpringerLink
Log in

Counting Distinct Items over Update Streams

  • Conference paper
Algorithms and Computation (ISAAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3827))

Included in the following conference series:

Abstract

We present two novel algorithms for tracking the number of distinct items over high speed data streams consisting of insertion and deletion operations that improves on the space and time complexity of existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Matias, Y., Szegedy, M.: The Space Complexity of Approximating the Frequency Moments. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing STOC 1996, Philadelphia, Pennsylvania, May 1996, pp. 20–29 (1996)

    Google Scholar 

  2. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating frequency moments. Journal of Computer Systems and Sciences 58(1), 137–147 (1998)

    Article  MathSciNet  Google Scholar 

  3. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, p. 1. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations (Extended Abstract). In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing STOC 1998, Dallas, Texas, May 1998, pp. 327–336 (1998)

    Google Scholar 

  5. Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. Journal of Computer Systems and Sciences 60(3), 630–659 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dubhashi, D., Priebe, V., Ranjan, D.: Negative Dependence through the FKG Inequality. Basic Research in Computer Science, Report Series, BRICSRS-96-27

    Google Scholar 

  7. Flajolet, P., Martin, G.N.: Probabilistic Counting Algorithms for Database Applications. Journal of Computer Systems and Sciences 31(2), 182–209 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ganguly, S., Garofalakis, M., Rastogi, R.: Processing Set Expressions over Continuous Update Streams. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA (2003)

    Google Scholar 

  9. Ganguly, S., Garofalakis, M., Rastogi, R., Sabnani, K.: Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks. Bell Laboratories Technical Memorandum (2004)

    Google Scholar 

  10. Gibbons, P.B.: Distinct Sampling for Highly-accurate Answers to Distinct Values Queries and Event Reports. In: Proceedings of the 27th International Conference on Very Large Data Bases, Roma, Italy (September 2001)

    Google Scholar 

  11. Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete, Greece, July 2001, pp. 281–291 (2001)

    Google Scholar 

  12. Gibbons, P.B., Tirthapura, S.: Distributed streams algorithms for sliding windows. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 2002, pp. 63–72 (2002)

    Google Scholar 

  13. Indyk, P., Woodruff, D.: Tight Lower Bounds for the Distinct Elements Problem. In: Proceedings of the 35th ACM Symposium on Theory of Computing (STOC 2003), San Diego, CA (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology, Kanpur

    Sumit Ganguly

Authors
  1. Sumit Ganguly
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganguly, S. (2005). Counting Distinct Items over Update Streams. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_51

Download citation

  • DOI: https://doi.org/10.1007/11602613_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation