Map
Index
Random
Help
th

Quote: expression for false-positives in a hash filter

references sa-sz > QuoteRef: stanC12_1986, p. 1231


--topics--
hash filter
probability

--subtopics--
optimizing Bloom filter
probablistic filters

Note

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.

Note by barberCB 1/87 filed


Copyright © 2002-2023 by C.B. Barber. Thesa, thid, and Avev are trademarks of C.B. Barber.