Data Science #28 - The Bloom filter algorithm – Data Science Decoded

In the 28th episode, we go over Burton Bloom's Bloom filter from 1970, a groundbreaking data structure that enables fast, space-efficient set membership checks by allowing a small, controllable rate of false positives.Unlike traditional methods that store full data, Bloom filters use a compact bit array and multiple hash functions, trading exactness for speed and memory savings.

This idea transformed modern data science and big data systems, powering tools like Apache Spark, Cassandra, and Kafka, where fast filtering and memory efficiency are critical for performance at scale.

Poddgruvan

Data Science #28 - The Bloom filter algorithm

Data Science #34 - The deep learning original paper review, Hinton, Rumelhard & Williams (1985)

Data Science #33 - The Backpropagation method, Paul Werbos (1980)

Data Science #32 - A Markovian Decision Process, Richard Bellman (1957)

Data Science #31 - Correlation and causation (1921), Wright Sewall

Data Science #30 - The Bootstrap Method (1977)

Data Science #29 - The Chi-square automatic interaction detection(CHAID) algorithm (1979)

Data Science #27 - The History of Least Squares (1877)

Data Science #26 - The First Gradient decent algorithm by Cauchy (1847)

Data Science #24 - The Expectation Maximization (EM) algorithm Paper review (1977)

Data Science #23- The Markov Chain Monte Carl MCMC Paper review (1953)