The current implementation of the optimization based on usage of in-memory rowid/pk filters built for selective range conditions directly stores rowids / primary keys of the filters in sorted arrays. These arrays are used only for an non-inclusion checks Using bloom filters for such checks will save a lot memory for each rowid / primary key because with bloom filters only 10 bits will be allocated for each rowid / primary key belonging to the filter set.

Inherit Rowid_filter_container to implement https://en.wikipedia.org/wiki/Bloom_filter