An in-memory bloom filter with persistence and HTTP interface
bloom
bloom-filters
bloom-filter
bloomfilter
probabilistic
bloom-server
probabilistic-data-structures
bloom-persistent
-
Updated
Aug 9, 2020 - C
An in-memory bloom filter with persistence and HTTP interface
Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.
Erlang NIF for Binary Fuse Filter. Fast and Smaller Than Xor Filters.
Add a description, image, and links to the probabilistic-data-structures topic page so that developers can more easily learn about it.
To associate your repository with the probabilistic-data-structures topic, visit your repo's landing page and select "manage topics."