In the fast query, it was doing 1 index FFS and one index range scan and then filter the data. Where as in other case it was only one FTS. I think if you remiove this bitmap index and just try a B-tree index then the timing should be less.