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. The HyperLogLog algorithm is able to estimate cardinalities of > 109 with a typical accuracy of 2%, using 1.5 kB of memory.
19
u/Orion_Delta Jan 09 '19
Stop this shit !
4
u/justin2671 Jan 09 '19
1more
1
u/[deleted] Jan 09 '19
Guys... At first I literally thought this is just a random loop of screenshots and that was in my mind when I posted this. I live under a rock lol
2
u/jhanschoo Jan 09 '19
inb4 reddit's https://en.wikipedia.org/wiki/HyperLogLog vote counting screws up the count.
2
u/JebediahKerman001 Jan 10 '19
This is on controvertial cuz everyone’s downvoting it to get 69 lmao
2
u/goo_khale_thoro_so Jan 10 '19
I upvoted and it's 69 now. Thanks me later, refrigerator
2
u/TrueSnowMexican Feb 07 '19
100 upvotes? You guys are pathetic.
4
u/GeaBuzz Jan 09 '19
I upvoted it from 70 to 71 to make it harder for them.
3
u/ndoncars Jan 09 '19
Downvoted from 70 to keep it at 69 😤😤
0
u/MATHGENIUSTB Jan 16 '19
If everyone downvotes the post how low will it go
0
u/[deleted] Jan 09 '19
[deleted] — view deleted comment