Alright, I am attempting to write a program that implements a bloom filter with a given set of hash functions from an input file that give m p c a0 b0.....a(c-1) b(c-1).
m = number of locations for bloom filter
p = large primenumber for hash functions
c = number of hash functions
ai and bi = parameter of the equations for the ith term
Also, we have to use string to integer mapping from the keys from a separate file.
All the code I have found through search is not very similar or not well commented. Does anybody have any snippets, well documented links, or easy to locate reading material?
Thanks in advance
