The collisions increased when the table size increased because Bloom filters (and hash tables in general) are sensitive to a number of parameters, not just gross size measures. In particular, hash functions are complicated enough to make ineffective simple-minded performance-improving heuristics, such as “more is better.”
This page last modified on 24 January 2006.