Rust implementation of the CVM algorithm for counting distinct elements in a stream
README update
author
Stephan Hügel
date
(May 24, 2024, 9:45 AM +0100)
commit
99d1aa35
99d1aa355f24cccfd1cfb3d33a411eab3465eb46
parent
df1c7cb8
df1c7cb88fa22fa14abb25e3be85d5ff023b9b8a
+3
-3
+3
-3
README.md
+3
-3
README.md
···
1
-
# Rust implementation of the CVM counting algorithm
1
+
# A Rust implementation of the CVM Distinct Elements counting algorithm
2
2
3
3
This library implements the algorithm described in
4
4
···
20
20
21
21
`-e --epsilon`: how close you want your estimate to be to the true number of distinct tokens. A smaller ε means you require a more precise estimate. For example, ε = 0.05 means you want your estimate to be within 5 % of the actual value. An epsilon of 0.8 is a good starting point for most applications.
22
22
23
-
`-d --delta`: the level of certainty that the algorithm's estimate will fall within your desired accuracy range. A higher confidence (e.g. 99.9 %) means you're very sure the estimate will be accurate, while a lower confidence (e.g. 90 %) means there's a higher chance the estimate may be outside your desired range. A delta of 0.1 is a good starting point for most applications
23
+
`-d --delta`: the level of certainty that the algorithm's estimate will fall within your desired accuracy range. A higher confidence (e.g. 99.9 %) means you're very sure the estimate will be accurate, while a lower confidence (e.g. 90 %) means there's a higher chance the estimate may be outside your desired range. A delta of 0.1 is a good starting point for most applications.
24
24
25
-
`-s --streamsize`: this is used to determine buffer size and can be a loose approximation. The closer it is to the stream size, the more accurate the results
25
+
`-s --streamsize`: this is used to determine buffer size and can be a loose approximation. The closer it is to the stream size, the more accurate the results.
26
26
27
27
The `--help` option is available.
28
28