bloom-filter

#搜索#适合静态网站的全文搜索引擎，使用Rust和Wasm

#算法刷题#2021年最新总结 500个常用数据结构，算法，算法导论，面试常用，大厂高级工程师整理总结

Probabilistic Datatypes Module for Redis

Probabilistic data structures for processing continuous, unbounded streams.

Redis for humans. 🌎🌍🌏

The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.

In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more

Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

Bloom filter for Scala, the fastest for JVM

🎯 Bloom filters for C++11

🔬 Assemble large genomes using short reads

LUA Redis scripts for a scaling bloom filter

Fast, reliable cuckoo hash table for Node.js.

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化

A simple and small bloom filter implementation in plain C.

fastfilter: Binary fuse & xor filters for Zig (faster and smaller than bloom filters)

A fast, simple and lightweight Bloom filter library for Python, implemented in Rust.

Hashing-function agnostic Cuckoo filters for Redis

Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 27GB/s + PRNG