HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality of a multiset requires an amount of memory proportional to the cardinality, which is impractical for very large data sets. Probabilistic cardinality estimators, such as the HyperLogLog algorithm, use significantly less memory than this, at the cost of obtaining only an approximation of the cardinality.
-
Notifications
You must be signed in to change notification settings - Fork 0
darkLord19/hyperloglog
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
HyperLogLog implementation in Go.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published