The problem is that bloom filters are good when your dataset is large and calculating several hashes per item is not as expensive as looking it up in the origin

The problem is that bloom filters are good when your dataset is large and calculating several hashes per item is not as expensive as looking it up in the original dataset. Here, they say that even one hash is expensive, so bloom filters would be much slower than the original hash map.