The best data structure ever. Probably.
Information
- Location:
- Software
Christopher A. Petro
I've been using Bloom filters for years. I got my information on them from the manual for an add-on indexing
library for Datapoint db/c, but the technique was just explained, not named. No one could ever tell me what they were called, including some of the crufty I-wirewrapped-my-own-S100-bus-PC people I've known, so ...I inevitably spent a lot of time explaining Bloom filters on whiteboards to people who were as impressed by them as I was when I first learned of them. I recently came across a reference to them in a paper and now I finally have a name to put to the data structure.Read More
library for Datapoint db/c, but the technique was just explained, not named. No one could ever tell me what they were called, including some of the crufty I-wirewrapped-my-own-S100-bus-PC people I've known, so ...I inevitably spent a lot of time explaining Bloom filters on whiteboards to people who were as impressed by them as I was when I first learned of them. I recently came across a reference to them in a paper and now I finally have a name to put to the data structure.Read More
Adam Hahn
I am so glad this fan page exists. Check out my interactive demonstration (written in Processing) to educate your friends! http://tr.ashcan.org/2008/12/bloomers.ht
Source: tr.ashcan.org
Since I thought a Bloom filter might be to blame in Mac OS X’s spellchecker, I made a little Processing app to demonstrate how exactly a Bloom filter works.
David Ellis Smoothed Bloom filter language models: Tera-Scale LMs on the Cheap
Source: acl.ldc.upenn.edu
Source: jeethurao.com
Continuing the theme of implementing simple datastructures in python and javascript, here's a simple countingbloom filter implementation in python and
Jim Voll One cannot survive in todays world without bloom filters
David Bloom Ok. I usually don't become a fan of anything on FB, but hey, how many people have a ridiculously complicated data structure named after them? (It may not be that complicated, but data structures are not my bag.) Suffice to say, this makes me the first Bloom who is a fan of the Bloom Filter...w00t!
Richard M. Geiger
OK, bob, you got my measly headcount of one. But to REALLY boost the count, why not join forces with the James Joyce fans who are bound to be lurking, and open up to a celebration of both the filter and the character, (who's story I uh err have not yet read)? Then we could all goe to Dublin in June and drink Guinness!
Who the hell is Ashton Kutcher?!
Bob English Ashton Kutcher has more fans than Bloom filters! This can not stand!
Bob English Keep up the bloomentum!
Bloom Filter We're up to 100 fans! Probably.
Chris The problem is, once you're a fan of the Bloom filter, you can never leave...
Bloom Filter Remember to tell your friends that they are also fans of me! Probably.
Christopher How can you not be a fan of a bloom filter? Use those things all the time.
Mark Marchukov Wikipedia article
Source: en.wikipedia.org
The Bloom filter, conceived by Burton H. Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. ...
