News for hackers. Stuff that matters.
Re:Count-Min Sketch (2019) by tromp on Saturday September 10, 2022 @03:18PM (#32793748)
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

Re:Count-Min Sketch (2019) by noelwelsh on Sunday September 11, 2022 @04:57AM (#32797991)
Yes, they both fall under the broad category of randomized algorithms, and under "magic you can perform with hash functions" in my personal taxonomy.
Re:Count-Min Sketch (2019) by vanderZwan on Sunday September 11, 2022 @06:25AM (#32798444)
> "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.

Re:Count-Min Sketch (2019) by archielc on Sunday September 11, 2022 @03:40AM (#32797601)
I remember learning about it from Redis: https://redis.io/docs/data-types/hyperloglogs/