A simple implement of bloom filter
A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not, thus a Bloom filter has a 100% recall rate. In other words, a query returns either “possibly in set” or “definitely not in set”.
A very simple implement of bloom filter
- Bloom filter http://en.wikipedia.org/wiki/Bloom_filter
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size BloomFilter-0.1.0.tar.gz (1.4 kB)||File type Source||Python version None||Upload date||Hashes View hashes|