I read an article about the Bloom filter but I am not really familiar with hash function. Is there any document online where I can find information about how to implement those hash functions?
Additionally, I am also interested about Bloom filter performance in realistic scenario. For example, I would like to know how many bits are needed for different applications, as a function of the number of items to be stored, typical false positive rate and so on.
Lastly, I would like to know if there are similar algorithms for set representation that can be more space efficient than Bloom filter but have some other drawbacks (for example, they may be affected by false negatives as well).