KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I've got the following question about choosing hash functions for Bloom filters: Which functions to use? In nearly every document/paper you can read that the hash functions used in a Bloom filter should be independent and uniformly distributed. I know what is meant by this (independent and uniformly distributed), but I'm having trouble to find a argumentation or a discussion, which hash functions fulfill those requirements and are therefore suitable. In a lot of posts I've read about suggestions for the usage of the FNV or Murmur hash function , but not why (or at least without a proof) they are suitable. Thanks in advance!
Tags (comma-separated)
Save Edits
Cancel