Counting Distinct Elements in a Data Stream (2002)
by
Ziv Bar-yossef
,
T. S. Jayram
,
Ravi Kumar
,
D. Sivakumar
,
Luca Trevisan
| Citations: | 111 - 4 self |
BibTeX
@MISC{Bar-yossef02countingdistinct,
author = {Ziv Bar-yossef and T. S. Jayram and Ravi Kumar and D. Sivakumar and Luca Trevisan},
title = {Counting Distinct Elements in a Data Stream},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present three algorithms to count the number of distinct elements in a data stream to within a factor of 1 ± epsilon. Our algorithms improve upon known algorithms for this problem, and offer a spectrum of time/space tradeoffs.
Citations
| 590 | Universal classes of hash functions - CARTER, WEGMAN - 1979 |
| 570 | The space complexity of approximating the frequency moments - Alon, Matias, et al. - 1999 |
| 284 | Probabilistic counting algorithms for data base applications - Flajolet, Martin - 1985 |
| 90 | Size-estimation framework with applications to transitive closure and reachability - Cohen - 1997 |
| 86 | Reductions in streaming algorithms, with an application to counting triangles - Bar-Yossef, Kumar, et al. |
| 74 | A linear-time probabilistic counting algorithm for database applications - WHANG, VANDER-ZANDEN, et al. - 1990 |
| 71 | Estimating simple functions on the union of data streams - GIBBONS, TIRTHAPURA - 2001 |
| 33 | Selectivity and cost estimation for joins based on random sampling - Haas, Naughton, et al. - 1996 |
| 19 | New classes and applications of hash functions - Wegman, Carter - 1979 |
