Data structure complementary of BloomFilters

147 views Asked by At

Are there any (probabilistic) data structures for set membership test that might produce false negative but not false positives? I'm looking for something similar to BloomFilters but with complementary behavior: If the answer to 'mightContain' is 'yes' then the set is guaranteed to contain the element; if the answer is 'no' then the set might still contain the element.

0

There are 0 answers