Crate hyperloglogplus

Implementations of the HyperLogLog algorithm for cardinality estimation.

HyperLogLog is an probabilistic algorithm for estimating the number of distinct elements (cardinality) of a multiset. The original algorithm, described by P. Flajolet et al. in HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm, can estimate cardinalities well beyond 10⁹ with a typical accuracy of 2% while using memory of 1.5 kilobytes. HyperLogLog variants can improve on those results.

All HyperLogLog variants should implement the HyperLogLog trait.

Current implementations:

• HyperLogLogPF
• HyperLogLogPlus

Structs

HyperLogLogPF

Implements the original HyperLogLog algorithm for cardinality estimation.

HyperLogLogPlus

Implements the HyperLogLog++ algorithm for cardinality estimation.

Enums

HyperLogLogError

Traits

HyperLogLog

A trait that should be implemented by any HyperLogLog variant.