EPISODE · Oct 16, 2025 · 30 MIN
When Close Enough is Good Enough (sps25)
from Chaos Computer Club - recent events feed (low quality) · host Tim Head
Sometimes getting an approximate answer is super good enough. How do you check for duplicates, count unique users, or track item popularity when your dataset won’t fit in memory? Enter probabilistic data structures like Bloom filters, Count-Min Sketches, and HyperLogLog! This talk introduces these powerful tools, demonstrates simple implementations in Python, and gives you ideas on when to use them. Walk away ready to apply these techniques in your own projects - no advanced math required. about this event: https://talks.python-summit.ch/sps25/talk/QBXDUQ/
What this episode covers
Sometimes getting an approximate answer is super good enough. How do you check for duplicates, count unique users, or track item popularity when your dataset won’t fit in memory? Enter probabilistic data structures like Bloom filters, Count-Min Sketches, and HyperLogLog! This talk introduces these powerful tools, demonstrates simple implementations in Python, and gives you ideas on when to use them. Walk away ready to apply these techniques in your own projects - no advanced math required. about this event: https://talks.python-summit.ch/sps25/talk/QBXDUQ/
NOW PLAYING
When Close Enough is Good Enough (sps25)
No transcript for this episode yet
Similar Episodes
Apr 21, 2026 ·73m
Apr 18, 2026 ·95m
Apr 15, 2026 ·55m
Apr 13, 2026 ·68m
Apr 11, 2026 ·59m
Apr 9, 2026 ·66m