Loading video...

Video Failed to Load

Go Home

Bloom filters: a simple structure for speeding up searches in sets, hash maps, and trees. They're a great tool for avoiding unnecessary disk reads in databases, as they can quickly confirm that a key does not exist in a data set. Clip from yesterday's stream.

36,085 views • 5 months ago •via X (Twitter)

0 Comments

No comments available

Comments from the original post will appear here

Related Videos