Benefits of Compressed Bloom Filters Array bits per elt. m/n 8 12.6 46 Trans.Bits per elt. z/n 8 7.582 6.891 Hash functions k 6 2 1 False positive rate f 0.0216 0.0216 0.0215 Array bits per elt. m/n 16 37.5 93 Trans.Bits per elt. z/n 16 14.666 13.815 Hash functions k 11 3 2 False positive rate 4.59E-04 4.54E-044.53E-04 Examples with fixed false probability rate. 5-15%compression for transmission size. 2222 Benefits of Compressed Bloom Filters  Examples with fixed false probability rate.  5-15% compression for transmission size. Array bits per elt. m/n 8 12.6 46 Trans. Bits per elt. z/n 8 7.582 6.891 Hash functions k 6 2 1 False positive rate f 0.0216 0.0216 0.0215 Array bits per elt. m/n 16 37.5 93 Trans. Bits per elt. z/n 16 14.666 13.815 Hash functions k 11 3 2 False positive rate f 4.59E-04 4.54E-04 4.53E-04