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.
Keywords
- Data Stream
- Hash Function
- Error Probability
- Distinct Element
- Computer Science Division
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.