Difference between revisions of "HyperLogLog"
Jump to navigation
Jump to search
Line 2: | Line 2: | ||
Calculating the exact cardinality of a [[multiset]] requires an amount of memory proportional to the [[cardinality]], which is impractical for very large data sets. | Calculating the exact cardinality of a [[multiset]] requires an amount of memory proportional to the [[cardinality]], which is impractical for very large data sets. | ||
+ | |||
+ | The HyperLogLog algorithm is able to estimate cardinalities of > 109 with a typical accuracy (standard error) of 2%, using 1.5 kB of memory | ||
[[/etc/redis.conf]] | [[/etc/redis.conf]] |
Revision as of 13:27, 8 July 2022
wikipedia:HyperLogLog is an algorithm for the count-distinct problem.
Calculating the exact cardinality of a multiset requires an amount of memory proportional to the cardinality, which is impractical for very large data sets.
The HyperLogLog algorithm is able to estimate cardinalities of > 109 with a typical accuracy (standard error) of 2%, using 1.5 kB of memory
/etc/redis.conf
Advertising: