Why Database Bloom Filters Defeat Expensive Disk Seeks cover art

Why Database Bloom Filters Defeat Expensive Disk Seeks

Why Database Bloom Filters Defeat Expensive Disk Seeks

Listen for free

View show details
Episode 130 dives deep into a single database index technique—the Bloom filter—and shows how it saves millions of disk seeks per second. Lucas explains how a probabilistic data structure with zero false negatives can check whether a key exists without touching storage, using an in-memory bit array and a handful of hash functions. He walks through the classic use case: Apache Cassandra's bloom_filter_fp_chance setting, where a 1% false-positive rate reduces wasted I/O by 99%. Luna probes the trade-off: memory vs. accuracy, and why PostgreSQL's Bloom index extension only makes sense for wide, low-cardinality columns. Together they unpack the math behind optimal hash-count (roughly 7 hash functions per element for a 1% false-positive rate) and why the real win isn't query speed but storage-amplification reduction. A concrete episode for anyone who's ever watched an index scan stall on spinning rust or even SSD latency spikes. #BloomFilter #DatabaseIndexing #ProbabilisticDataStructures #ApacheCassandra #PostgreSQL #DiskSeek #StorageAmplification #HashFunctions #FalsePositiveRate #ReadPathOptimization #LSMTrees #CassandraTuning #bloom_filter_fp_chance #Technology #FexingoBusiness #BusinessPodcast #DataEngineering #DatabaseTech Keep every episode free: buymeacoffee.com/fexingo
adbl_web_anon_alc_button_suppression_t1
No reviews yet