🔍 Tiny, full-text search engine for static websites built with Rust and Wasm
-
Updated
Oct 18, 2023 - Rust
🔍 Tiny, full-text search engine for static websites built with Rust and Wasm
2021
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.
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
Bloom filter for Scala, the fastest for JVM
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
LUA Redis scripts for a scaling bloom filter
🔬 Assemble large genomes using short reads
Fast, reliable cuckoo hash table for Node.js.
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized
fastfilter: Binary fuse & xor filters for Zig (faster and smaller than bloom filters)
Interesting (non-cryptographic) hashes implemented in pure Python.
Hashing-function agnostic Cuckoo filters for Redis
A fast, simple and lightweight Bloom filter library for Python, implemented in Rust.
Add a description, image, and links to the bloom-filter topic page so that developers can more easily learn about it.
To associate your repository with the bloom-filter topic, visit your repo's landing page and select "manage topics."