The variables and are related to each other with the following approximation, formula (1): p, n, m k (1) The optimal value of is given by: k, (2) Substituting from (2) in (1) and reordering terms, the value of rounded to the nearest multiple of 8, is given by: k m, (3) For example, for services and the size of the Bloom filter is 240 bits and the required number of hash n=25 p=0.01, m function is 7.
The variables p, n, m and k are related to each other with the following approximation, formula (1): (1) The optimal value of k, is given by: (2) Substituting k from (2) in (1) and reordering terms, the value of m, rounded to the nearest multiple of 8, is given by: (3) For example, for n=25 services and p=0.01, the size of the Bloom filter m is 240 bits and the required number of hash function is 7.
11-15-0273-00-00aq-tgaq-lb208-d1-0-editor-s-technical-comments.docx