Skip to main content

Module approximate_counter

Module approximate_counter 

Source
Expand description

Approximate cardinality counting using HyperLogLog (v1.1.0 round 15) Approximate cardinality counting using the HyperLogLog algorithm.

HyperLogLog (HLL) is a probabilistic data structure for estimating the cardinality of large multisets using sub-linear memory. This implementation follows the original Flajolet et al. 2007 paper with small/large range corrections and 64-bit FNV-1a hashing.

Structs§

CardinalityEstimator
Multi-stream cardinality estimator backed by one HLL sketch per stream.
HyperLogLog
A single HyperLogLog sketch for estimating cardinality.

Enums§

CounterError
Errors returned by HyperLogLog and cardinality-estimator operations.