Skip to content
When Close Enough is Good Enough (sps25) episode artwork

Oct 16, 2025 30 min

When Close Enough is Good Enough (sps25)

from Chaos Computer Club - archive feed Hosted by 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/

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

When Close Enough is Good Enough (sps25)

0:00 30:56

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Chaos Computer Club - archive feed?

This episode is 30 minutes long.

When was this Chaos Computer Club - archive feed episode published?

This episode was published on October 16, 2025.

Can I download this Chaos Computer Club - archive feed episode?

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