Skip to main content

Table 4 Estimated fractions of queries resolved by each filter and by the explicitely stored set T t for t =1,2,4, computed for k =32 and optimal value of r shown in the second column

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

Value oft r B 1 B 2 B 3 B 4 T t
1 11.44 74.70% 0 0 0 25.3%
2 8.060 73.44% 24.48% 0 0 2.08%
4 6.049 70.90% 23.63% 3.88% 1.29% 0.3%