Skip to content
More Optimal Bloom Filters episode artwork

EPISODE · Apr 18, 2008

More Optimal Bloom Filters

from Scale Cast – A podcast about big data, distributed systems, and scalability · host burtonator

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 […]

Episode metadata supplied by the publisher feed · Published Apr 18, 2008

Embed this episode

Ready to play

More Optimal Bloom Filters

0:00 0:00

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

When was this Scale Cast – A podcast about big data, distributed systems, and scalability episode published?

This episode was published on April 18, 2008.

Can I download this Scale Cast – A podcast about big data, distributed systems, and scalability episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!