Hello Avinash,
I was testing bloom indexes today. I understand bloom indexes uses bloom filters. [...] So the question here is - I assume - number of bits = k. Where k is the total number of hash functions used on top of the data that needs to validated. Is that correct ? If yes, why do we see the Index 1 performing better than Index 2 ? Because, the data has to go through more hash functions (4 vs 2) in Index 1 than Index 2. So, with Index 1 it should take more time. Also, both the indexes have ZERO false positives. Please let me know if there is anything simple that i am missing here.
You may have a look at the blog entry about these parameters I redacted a few year ago:
http://blog.coelho.net/database/2016/12/11/postgresql-bloom-index.html -- Fabien.
