Implemented algorithms for cardinality and rank estimation
Pre-release
Pre-release
In this pre-release implemented the following algorithms:
Cardinality problem
- Linear counter
- Probabilistic counter (Flajolet–Martin algorithm)
Rank problem
- Quantile Digest (q-digest)
Additionally, the overall code has been improved, added tests and examples how to use the implemented data structures.