hackage.haskell.org : unagi-bloomfilter
This library implements a fast concurrent bloom filter, based on bloom-1 from "Fast Bloom Filters and Their Generalization" by Y Qiao, et al. A bloom filter is a probabilistic, constant-space, set-like data structure supporting insertion and membership queries. This implementation is backed by SipHash so can safely consume untrusted inputs. The implementation here compares favorably with traditional set implementations in a single-threaded context, e.g. here are 10 inserts or lookups compared across some sets of different sizes:
Registry
-
Source
- Homepage
- JSON
purl: pkg:hackage/unagi-bloomfilter
Keywords:
bsd3
, concurrency
, library
, Propose Tags
License: BSD-3-Clause
Latest release: over 7 years ago
First release: almost 9 years ago
Downloads: 2,539 total
Stars: 19 on GitHub
Forks: 2 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 13 days ago