Probabilistic Membership
← Back to Bloom Filters
Uses multiple hash functions and a bit array to test set membership. The answer is either “definitely not in the set” or “probably in the set” with a configurable false positive rate.
← Back to Bloom Filters
Uses multiple hash functions and a bit array to test set membership. The answer is either “definitely not in the set” or “probably in the set” with a configurable false positive rate.