various probabilistic data structures implemented in C
-
Updated
Oct 24, 2024 - C
various probabilistic data structures implemented in C
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF).
A Golang multi-level caching framework based on Redis and local memory for distributed scenarios.
shortlink service
A variant of Cuckoo Filter whose size automatically scales as necessary
Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
Cuckoo Filter: Practically Better Than Bloom
Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.
High-performance, concurrent, and mutable Cuckoo Filter for Erlang and Elixir
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
An abstraction layer around implementations of probabilistic membership testing
A tool and a lib to create and verify "dilated" fingerprints of files to avoid human mistakes !!! Migrated to Codeberg 🏔️ !!!
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化
a redis bloomfilter and cuckoo filter service with basic reserve,exists, delete and insert functionality. The cuckoo filter will also have the delete-item functionality as well.
Cuckoo Filter in golang for set membership approximation
https://github.com/linvon/cuckoo-filter wrap, support redis persistence
Cuckoo Filter: Practically Better Than Bloom
Add a description, image, and links to the cuckoo-filter topic page so that developers can more easily learn about it.
To associate your repository with the cuckoo-filter topic, visit your repo's landing page and select "manage topics."