Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
-
Updated
Aug 14, 2024 - Rust
#
hyperloglog
Here are 15 public repositories matching this topic...
Lightning fast concurrent HyperLogLog for Rust.
-
Updated
Jul 30, 2025 - Rust
Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
-
Updated
Jun 10, 2025 - Rust
A crate for estimating the cardinality of distinct elements in a stream or dataset.
-
Updated
Feb 18, 2025 - Rust
Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog
hyperloglog cardinality-estimation streaming-algorithms metagenome average-nucleotide-identity hyperloglogplus ultraloglog genome-sketching hyperminhash
-
Updated
Nov 12, 2025 - Rust
A simple HyperLogLog implementation in rust
-
Updated
Sep 3, 2025 - Rust
A SIMD optimized implementation of the HLL and HLL++ algorithms in Rust
-
Updated
Sep 21, 2023 - Rust
HyperLogLog is a Space-Efficient Probabilistic Algorithm Designed for Cardinality Estimation
-
Updated
Nov 9, 2025 - Rust
Redis re-implemented in Rust, featuring robust multi-threading support.
-
Updated
Oct 14, 2024 - Rust
A rust implementation of google's HyperLogLog for cardinality estimation
-
Updated
May 16, 2025 - Rust
Rust port of the Google Zetasketch library
-
Updated
Oct 27, 2025 - Rust
Rust implementation of a probabilistic multiset cardinality algorithm
-
Updated
Nov 16, 2024 - Rust
Improve this page
Add a description, image, and links to the hyperloglog topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the hyperloglog topic, visit your repo's landing page and select "manage topics."