Surrogate table of k bits, storing w words, with i hashed-bits set for each word. The probability of a false-positive is (1- ((k-1)/k)^wi)^i.
Related Topics
Topic: hash filter (18 items) Topic: probability (21 items)