Live data from Hacker News

Scalable Bloom Filters (2007) [pdf]

citeseerx.ist.psu.edu

1–10 of 39 posts

Re: Scalable Bloom Filters (2007) [pdf]

#4
post #2

Hacker news loves upvoting articles about bloom filters (and Bayesian probability - its on the front page again this evening.) Personally I've never found a use for either of them in practice.

They are upvoted because they are extremely nifty and useful :)

Check out their usage in Cassandra: http://cassandra.apache.org/doc/latest/operating/bloom_filte...

There should be many more you can find via quick googling.

Re: Scalable Bloom Filters (2007) [pdf]

#7
post #2

Hacker news loves upvoting articles about bloom filters (and Bayesian probability - its on the front page again this evening.) Personally I've never found a use for either of them in practice.

It's used in this awesome extension to know if a page has been submitted to HN before without making any network requests.

https://chrome.google.com/webstore/detail/hacker-news-filter...

Re: Scalable Bloom Filters (2007) [pdf]

#9

This should also be marked with a year. A cursory google search has StackOverflow answers from 2013. A lack of a year label implicitly suggests that it’s new, e.g. Hacker News. Please add a tag with the appropriate year.

Looks like it's from 2007:

https://www.sciencedirect.com/science/article/pii/S002001900...

Re: Scalable Bloom Filters (2007) [pdf]

#10
post #2

Hacker news loves upvoting articles about bloom filters (and Bayesian probability - its on the front page again this evening.) Personally I've never found a use for either of them in practice.

I’ve used them in production several times, recently when I needed to quickly check to see if a set of numbers were likely all the IDs of a particular kind of object, where the ID space is 64-bit ints and the population is in the hundreds of millions. We didn’t need perfection, just a bound error rate and predictable memory consumption, and a pre-loaded BF was perfect in this role.
Post reply on HN