What are Bloom filters? (2015)
blog.medium.com
What are Bloom filters? (2015)
1–10 of 24 posts
Re: What are Bloom filters? (2015)
#2Re: What are Bloom filters? (2015)
#3Re: What are Bloom filters? (2015)
#4Naturally, if consensus were established between nodes, using something like this would be unnecessary, but it turned out to be an interesting way of optimizing lookups in a DHT.
Re: What are Bloom filters? (2015)
#5How many times on HN must this topic come up?
Re: What are Bloom filters? (2015)
#6Re: What are Bloom filters? (2015)
#7A bit long winded, but a good, thoughtful explanation. I honestly didn't know what they were, only how they could be used. Now I know.
Re: What are Bloom filters? (2015)
#8Bloom filters are a really interesting data structure. Whenever I found out about them I really wanted to use them, so I ended up building a distributed hash table. I thought bloom filters could be an interesting way to optimize key lookup value throughout the network, as I could use a bloom filter to state that a remote node definitely didn't have a key (therefore, no need to send a request to them) or if a node lik…
Re: What are Bloom filters? (2015)
#9[1]: https://www.cs.cmu.edu/~dga/papers/cuckoo-conext2014.pdf