Hashing-function agnostic Cuckoo filters for Redis
-
Updated
Mar 5, 2020 - Zig
Hashing-function agnostic Cuckoo filters for Redis
Probabilistic Data Structures and Algorithms in Python
Simple probabilistic data structures
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
A probabilistic data structures library for C#
Bloomfilter written in Golang, includes rotation and RPC
Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
🌺 A pure Elixir implementation of Scalable Bloom Filters
An in-memory bloom filter with persistence and HTTP interface
A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.
Simple and efficient bloom filter implementations in Go
Probabilistic Data Structure Template Library
Cuckoo Filter: Practically better than bloom filter
Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.
Production-ready Cuckoo Filters for any C ABI compatible target.
Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
Production-ready Java implementation of the Xor Filter.
Fast Bloom filter with concurrent accessibility, powered by :atomics module.
Exploring Probabilistic Data Structures in Python - my 2021 Pycon USA and Australia and Pycon MEA 2022 talk.
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."