AdamWhiteHat / BloomFilterView on GitHub
A novel, space-efficient, probabilistic data structure for hashing a large number of values. It is similar to a hash table, but smaller because it does not need to store the entire value like HashTable and has better asymptotic performance, at the cost of possible false-positives, a likelihood that is configurable. False negatives are not possib…
☆11Oct 18, 2024Updated last year

Alternatives and similar repositories for BloomFilter

Users that are interested in BloomFilter are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.

Sorting:

Are these results useful?