this post was submitted on 18 May 2024
261 points (98.5% liked)

xkcd

16145 readers
1530 users here now

A community for a webcomic of romance, sarcasm, math, and language.

founded 2 years ago
MODERATORS
 

https://xkcd.com/2934

Alt text:

Sometimes, you can tell Bloom filters are the wrong tool for the job, but when they're the right one you can never be sure.

all 17 comments
sorted by: hot top controversial new old
[–] LPThinker@lemmy.world 31 points 2 years ago (1 children)

For anyone interested in learning more about bloom filters, this is a technical but extremely accessible and easy to follow introduction to them, including some excellent interactive visualizations: https://samwho.dev/bloom-filters/

[–] gbuttersnaps@programming.dev 6 points 2 years ago

This was a great read, thanks for sharing!

[–] randomaccount43543@lemmy.world 22 points 2 years ago
[–] Xeroxchasechase@lemmy.world 16 points 2 years ago (3 children)

Is'nt bloom filter a shader that makes the picture look hazy and bright?

[–] Ephera@lemmy.ml 30 points 2 years ago (1 children)

That's the bloom shader effect: https://en.wikipedia.org/wiki/Bloom_(shader_effect)

But yeah, some people might refer to that as "bloom filter", although it's not what's meant here.

[–] rockSlayer@lemmy.world 6 points 2 years ago (1 children)

A bloom filter is a data structure that is most useful in creating a spell check algorithm

[–] Audalin@lemmy.world 10 points 2 years ago (1 children)

There's a recent algorithm using somewhat similar ideas for approximate counting of unique objects in a stream with constant memory:

https://www.quantamagazine.org/computer-scientists-invent-an-efficient-new-way-to-count-20240516/

[–] Mubelotix@jlai.lu 2 points 2 years ago

I think I like hash-based probabilistic counting better, but this is interesting

[–] Venat0r@lemmy.world 1 points 2 years ago* (last edited 2 years ago)

Not to be confused with Bloom shader effect.