Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
-
Updated
Aug 14, 2024 - Rust
Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
A deterministic genomics engine with O(√t) memory. Run whole-genome workloads in <100 MB RAM. Built in Rust.
Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog
Process any data size with a fixed, small memory footprint. EM-√ is an external-memory ETL/log processing engine with hard peak-RAM guarantees. Unlike traditional systems that "try" to stay within memory limits, EM-√ enforces a strict memory cap, enabling you to process arbitrarily large datasets using small memory footprints.
Approximate UniFrac via Weighted MinHash 🦀
Sublinear-space zero-knowledge proof system with production REST API. TinyZKP is a high-performance ZKP prover/verifier that uses only O(√T) memory for proofs over traces of length T, rather than the typical O(T) that most systems require.
Add a description, image, and links to the streaming-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the streaming-algorithms topic, visit your repo's landing page and select "manage topics."