An implementation of the HyperLogLog algorithm in Erlang
An implementation of the HyperLogLog algorithm in Erlang. Using HyperLogLog you can estimate the cardinality of very large data sets using constant memory. The relative error is 1.04 * sqrt(2^P). When creating a new HyperLogLog filter, you provide the precision P, allowing you to trade memory for accuracy. The union of two filters is lossless.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 0-0.20.20161011git4b1abc4.fc38 | - |
Fedora 38 | 0-0.20.20161011git4b1abc4.fc38 | - |
Fedora 37 | 0-0.19.20161011git4b1abc4.fc37 | - |
Fedora 36 | 0-0.17.20161011git4b1abc4.fc36 | - |
You can contact the maintainers of this package via email at
erlang-hyper dash maintainers at fedoraproject dot org
.