Bloom Filters - Part 1 of 3
Ғылым және технология
Part 1 in a 3 part series working up to a new set reconciliation algorithm.
"Space/time trade-offs in hash coding with allowable errors" by Burton H. Bloom dl.acm.org/doi/10.1145/362686...
Chapters:
00:00 Intro
00:31 What's a Bloom Filter
02:40 Building a Bloom Filter
04:02 Querying a Bloom Filter
05:28 Parameter Tuning
07:47 In Distributed Systems
Пікірлер: 14
Dude you're my new favourite tech educator. Great energy, and very nice presentation
Ah, b5, you have such an elegant way of explaining concepts that I have put off exploring. Keep 'em coming!
@n0computer
Ай бұрын
Thanks @machawk1! Will do!
Bloom filters for the win! Thanks for sharing. This is great
I like your videos. I found you when I was implementing mDHT and I needed to learn how kademlia works. Really thanks for publishing this.
@n0computer
Ай бұрын
Glad it was helpful!
Thank you for posting this!
finally a new video! I love you!!
This is great content! I don’t usually comment but I feel this content is too amazing to not to say anything. This channel should (and I hope) become big!!
@n0computer
Ай бұрын
appreciate it! Lots of fun stuff to talk about in the coming weeks!
Amazing content, thanks for sharing!
SO GOOD
Good video. These straight forward bloom filters only sound useful in very specific circumstances. Like if you are writing a database, and want a cheap way to be pretty sure you do _not_ hold a key without checking directly on disk.
The "algorithm" needs to promote you, sadly it's dumb as a brick.