Approximate Membership Query Filter
is a group of space-efficient probabilistic data structures that supports approximate membership queries
Cuckoo filter
data structure for approximate set membership
Bloom filter
hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives