A simple implement of bloom filter
Project description
Introduction
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
Referencek
Bloom filter http://en.wikipedia.org/wiki/Bloom_filter
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
BloomFilter-0.1.0.tar.gz
(1.4 kB
view details)
File details
Details for the file BloomFilter-0.1.0.tar.gz.
File metadata
- Download URL: BloomFilter-0.1.0.tar.gz
- Upload date:
- Size: 1.4 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
004ae2027074a77bfa76737df90e8b4bee021c76fab9438a73442a57c4e0bcc2
|
|
| MD5 |
c941c8d157394ddb7ca779e8844d1e01
|
|
| BLAKE2b-256 |
c48891cee48191b6b99c98171af0f29e49cb75497cc1bebe2fd51f021f7b40ed
|
