Skip to main content

Table 3 Estimations of the number of queries made to filters B 1 , B 2 , B 3 , B 4 and of the fraction of queries resolved by each filter (for the optimal value r =5 . 464), in the case of infinite number of filters

From: Using cascading Bloom filters to improve the memory usage for de Brujin graphs

  B 1 B 2 B 3 B 4
nb of queries 8N (2+6cr)N (6cr+2cr)N (2cr+6c2r)N
Queries returning yes (2+6cr)N (6cr+2cr)N (2cr+6c2r)N (6c2r+2c2r)N
Queries returning no (6−6cr)N (2−2cr)N (6cr−6c2r)N (2cr−2c2r)N
Fraction of resolved queries 69.57% 23.19% 5.04% 1.68%