[Swift 4.2] Bloom Filter #759
Conversation
* Remove the top code snippet, as per instructions. * Remove use of deprecated `characters` property.
* Adds a section about another Bloom filter approach, using only a single hashing function with Swift 4.2's `Hasher`. * Adds links to some more documentation and a blog post implementing the Bloom filter in this way. * Adds my name as updater.
|
References #748. |
Bloom Filter/README.markdown
Outdated
| *Written for Swift Algorithm Club by Jamil Dhanani. Edited by Matthijs Hollemans.* | ||
| ## Another approach | ||
|
|
||
| Another approach to create different hashes of an element for use in the Bloom filter, is to use the same hash function for every iteration, but combine it with different random numbers. This can help, because finding good hashing functions is hard, but combining them is equally non-trivial. |
There was a problem hiding this comment.
This part is unclear for me.
My understanding of hash functions is that it should be deterministic -- "hello world!" should hash to the same value during the lifetime of a single program.
If you combine the result of the hash function with different random numbers, wouldn't that just be akin to producing random numbers?
There was a problem hiding this comment.
For the Bloom filter, the actual hash isn't important, as long as it is consistent and a proper hash. So if you guarantee that you acquire the hash for the same object in the same way during the lifetime of the Bloom filter, you're fine.
This approach would create random numbers at the initialisation of the Bloom filter, and use them consistently as modifiers on an object's hash, effectively creating a new hash function per random number. So the hash would still be same for object A during the lifetime of that Bloom filter.
Make sense? The linked blog post about it is probably clearer.
There was a problem hiding this comment.
Ah, I see what you're getting at. I read this as "everything time you use the hash function, combine it with a random number."
I propose we change this paragraph to the following:
In the previous section, you learnt about how using multiple different hash functions can help reduce the chance of collisions in the bloom filter. However, good hash functions are difficult to design. A simple alternative to multiple hash functions is to use a set of random numbers.
As an example, let's say a bloom filter wants to hash each element 15 times during insertion. Instead of using 15 different hash functions, you can rely on just one hash function. The hash value can then be offset by 15 different values to form the indices for flipping. This bloom filter would initialize a set of 15 random numbers ahead of time and use these values during each insertion.
Let me know if that sounds fine with you. If this is okay, I'll go ahead and make the change to merge it in.
There was a problem hiding this comment.
Updated the README.
|
Thanks @SpacyRicochet! |
2 participants
Checklist
Description