A crate for estimating the cardinality of distinct elements in a stream or dataset.
-
Updated
Sep 20, 2024 - Rust
A crate for estimating the cardinality of distinct elements in a stream or dataset.
Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Fast HyperLogLog for Python.
C++ program for estimating the entropy of incoming traffic.
Dynatrace hash library for Java
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
A simple HyperLogLog implementation in rust
Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
Redis re-implemented in Rust, featuring robust multi-threading support.
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
Server log analyzer.
MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
HyperLogLog cardinality estimation algorithm in go/golang!
ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
Add a description, image, and links to the hyperloglog topic page so that developers can more easily learn about it.
To associate your repository with the hyperloglog topic, visit your repo's landing page and select "manage topics."