tl;dr A Bloom filter implements the predicate isMemberOf efficiently--at the cost of some false postives. Its performance degrades when the set is large. Soluti

tl;dr A Bloom filter implements the predicate isMemberOf efficiently--at the cost of some false postives. Its performance degrades when the set is large. Solution: index your set by time, implementing a Bloom filter for each epoch.