Counting Distinct Elements in a Data Stream

  • Ziv Bar-Yossef
  • T. S. Jayram
  • Ravi Kumar
  • D. Sivakumar
  • Luca Trevisan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2483)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ziv Bar-Yossef
    • 1
  • T. S. Jayram
    • 2
  • Ravi Kumar
    • 2
  • D. Sivakumar
    • 2
  • Luca Trevisan
    • 3
  1. 1.Computer Science DivisionUniv. of California at BerkeleyBerkeley
  2. 2.IBM Almaden Research CenterSan Jose
  3. 3.Computer Science DivisionUniv. of California at BerkeleyBerkeley

Personalised recommendations