4 ms·
This reminds me of the HyperLoglog [1] algorithm for approximating the cardinality of a huge set with limited memory. [1] https://en.wikipedia.org/wiki/HyperLo
by tromp 4y ago
This reminds me of the HyperLoglog [1] algorithm for approximating the cardinality of a huge set with limited memory.
[1] https://en.wikipedia.org/wiki/HyperLogLog https://en.wikipedia.org/wiki/HyperLogLog
- archielc 4y agoI remember learning about it from Redis: https://redis.io/docs/data-types/hyperloglogs/ https://redis.io/docs/data-types/hyperloglogs/
- noelwelsh 4y agoYes, they both fall under the broad category of randomized algorithms, and under "magic you can perform with hash functions" in my personal taxonomy.
- vanderZwan 4y ago> "magic you can perform with hash functions" I really would love to see a book that basically just covers all the cool data structures people have come up with using hash functions.