cuckoo: Haskell Implementation of Cuckoo Filters
Haskell implementation of Cuckoo filters as described in
Cuckoo filters are a data structure for probabilistic set membership. They support insertion, deletion, and membership queries for set elements.
Membership queries may return false positive results. But queries don't return false negative results.
Unlike Bloom filters, Cuckoo filters maintain an upper bound on the false positive rate that is independent of the load of the filter. However, insertion of new elements in the filter can fail. For typical configurations this probability is very small for load factors smaller than 90 percent.
[Skip to Readme]
Flags
Manual Flags
| Name | Description | Default |
|---|---|---|
| mwc-random | Use mwc-random instead of the random package | Disabled |
| pcg-random | Use pcg-random instead of the random package | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- cuckoo-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.1, 0.2.2, 0.3.0, 0.3.1 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.11 && <4.15), cuckoo, memory (>=0.14), primitive (>=0.7), random (>=1.1), vector (>=0.12) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2019, Lars Kuhtz <lakuhtz@gmail.com> |
| Author | Lars Kuhtz |
| Maintainer | lakuhtz@gmail.com |
| Category | Data |
| Home page | https://github.com/larskuhtz/cuckoo |
| Bug tracker | https://github.com/larskuhtz/cuckoo/issues |
| Source repo | head: git clone https://github.com/larskuhtz/cuckoo.git |
| Uploaded | by larsk at 2019-08-17T06:07:43Z |
| Distributions | |
| Downloads | 2229 total (20 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2019-08-17 [all 1 reports] |
Readme for cuckoo-0.1.0.0
[back to package description]
Haskell implementation of Cuckoo filters as described in
Cuckoo filters are a data structure for probabilistic set membership. They support insertion, deletion, and membership queries for set elements.
Membership queries may return false positive results. But queries don't return false negative results.
Unlike Bloom filters, Cuckoo filters maintain an upper bound on the false positive rate that is independent of the load of the filter. However, insertion of new elements in the filter can fail. For typical configurations this probability is very small for load factors smaller than 90 percent.
The implementation allows the user to specify the bucket size and the fingerprint size in addition to the capacity of the filter. The user can also provide custom functions for computing the primary hash and fingerprint.