←back to thread

Bloom Filters by Example

(llimllib.github.io)
243 points ibobev | 2 comments | 29 Jun 25 11:56 UTC | HN request time: 0s | source
Show context
jedberg ◴[29 Jun 25 21:28 UTC] No.44416582[source]▶
I love me a good bloom filter. Bloom filters are one of the concepts I try to make sure everyone I talk to about tech knows -- the others being Random Weight Hashing (aka Rendezvous Hashing, aka Highest Random Weight Hashing) and Cumulative flow diagrams.

All three concepts are key in understanding operations of complex distributed systems.

replies(1): >>44416764 #
1. sureglymop ◴[29 Jun 25 21:48 UTC] No.44416764[source]▶
What about distributed hash table architectures in general? circle, chord, CAN and kademlia, etc.
replies(1): >>44416844 #
2. jedberg ◴[29 Jun 25 21:57 UTC] No.44416844[source]▶
There's only so many things you can put on your "I must tell everyone I meet about this" list. :)

But yes, those are pretty important too.