Counting Distinct Elements in a Data Stream

  title={Counting Distinct Elements in a Data Stream},
  author={Ziv Bar-Yossef and T. S. Jayram and Ravi Kumar and D. Sivakumar and L. Trevisan},
  • Ziv Bar-Yossef, T. S. Jayram, +2 authors L. Trevisan
  • Published in RANDOM 2002
  • Computer Science
  • We present three algorithms to count the number of distinct elements in a data stream to within a factor of 1 ± ?. Our algorithms improve upon known algorithms for this problem, and offer a spectrum of time/space tradeoffs. 

    Topics from this paper.

    Counting distinct items over update streams
    • 56
    • PDF
    Counting Distinct Items over Update Streams
    • 4
    Data streams: algorithms and applications
    • 1,662
    • PDF
    An optimal algorithm for the distinct elements problem
    • 261
    • Highly Influenced
    • PDF
    Space efficient mining of multigraph streams
    • 130
    • PDF
    An improved data stream summary: the count-min sketch and its applications
    • 1,525
    • PDF
    Sketching and streaming algorithms for processing massive data
    • 9
    • PDF
    Distinct-Values Estimation over Data Streams
    • 12
    • Highly Influenced
    • PDF


    Publications referenced by this paper.