sentence1: a bloom-filter is a probabilistic data structure with no false negatives , which can be used to test set membership in constant time .
sentence2: a bloom filter is a probabilistic data structure for the approximate set membership problem .