
An Introduction to ZooKeeper Video
Apr 26, 2008
Radio and PodcastLive Radio & Podcasts
The Bloom filter, conceived by Burton H. Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives ar...
More Optimal Bloom Filters is an episode from Scale Cast – A podcast about big data, distributed systems, and scalability. The Bloom filter, conceived by Burton H. Bloom in 1970, is a space-efficient probabilistic data structure that is use...
This episode belongs to Scale Cast – A podcast about big data, distributed systems, and scalability.
Use the player on this page to stream the episode online.
Published Apr 18, 2008, audio available.
The Bloom filter, conceived by Burton H. Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be added to the set, but not removed (though this can be addressed with […]
You can listen to More Optimal Bloom Filters online on Radio and Podcast. Open the player on this page to stream the available audio.
More Optimal Bloom Filters is an episode from Scale Cast – A podcast about big data, distributed systems, and scalability.
The episode duration depends on the source podcast feed and may not always be available.
This episode was published on Apr 18, 2008.
Yes. Use the heart button on the episode page to add it to your favorite episodes list.
Yes. This page shows related episodes from Scale Cast – A podcast about big data, distributed systems, and scalability when more episodes are available from the podcast feed.
You can listen to More Optimal Bloom Filters on this page when the episode audio is available from the podcast feed.
More Optimal Bloom Filters is from Scale Cast – A podcast about big data, distributed systems, and scalability.
Published Apr 18, 2008