Live data from Hacker News

What are Bloom filters? (2015)

blog.medium.com

1–10 of 24 posts

Re: What are Bloom filters? (2015)

#4
Bloom 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 likely had a key (therefore, sending a request to get the key's value).

Naturally, 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)

#8

Bloom 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…

this is why Cassandra works this way

Re: What are Bloom filters? (2015)

#9
Bloom filters are great, but unfortunately don't support deletions of items as a particular key might be being used by more than element in the filter and you don't know if it's same to delete. A few weeks ago, someone posted about Cuckoo Filters [1] which are like Bloom Filters but allow for key deletion.

[1]: https://www.cs.cmu.edu/~dga/papers/cuckoo-conext2014.pdf

Post reply on HN