Advertisement

Counting distinct elements in Redis: The Hyperloglog algorithm

Counting distinct elements in Redis: The Hyperloglog algorithm The HyperLogLog is a new way in which distinct elements in a distributed system are counted. It is an approximation algorithm implemented in systems like Redis and Facebook. The algorithm uses hashing and expected probabilities to deduce the number of unique elements in a given search space.

References:





AlgoExpert:


Made by engineers from Google and Uber, this site helps you build your algorithmic skills using code and white board explanations.
Be sure to use the code 'gaurav' for the discount. You get 30% off!

Preparing for design Interviews? Check out the "Grokking the system design interview" course:


System Design Playlist:

Become a channel member!


You can follow me on:
Facebook:
Quora:
LinkedIn:
Twitter:

hyperloglog,redis,hyperloglog algorithm,count distinct elements,count distinct,distinct keyword,hashing,unique hash,gaurav sen,gkcs,

Post a Comment

0 Comments