February 2018
Intermediate to advanced
382 pages
11h 33m
English
Each command of HLL in Redis starts with PF, in honor of Philippe Flajolet who is the inventor of the HLL data structure. We won't dive into the detail of HLL algorithms in this book. The advantage of HLL in Redis is that it computes the distinct counts using a fixed amount of memory (less than 12 kb per key for up to 2^64 cardinalities) and constant time complexity (O(1) per key). However, there is a trade-off regarding HLL algorithms in that the cardinality returned is not exact, with a standard error of less than 1%.
Read now
Unlock full access