Dynatrace hash library for Java
-
Updated
Jun 28, 2024 - Java
Dynatrace hash library for Java
Redis re-implemented in Rust, featuring robust multi-threading support.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
A crate for estimating the cardinality of distinct elements in a stream or dataset.
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
HyperLogLog cardinality estimation algorithm in go/golang!
Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
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
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
A simple HyperLogLog implementation in rust
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
Exploring Probabilistic Data Structures in Python - my 2021 Pycon USA and Australia and Pycon MEA 2022 talk.
Unique site visits counter in Go
Estimating k-mer coverage histogram of genomics data
Distributed Cardinality Tracking
A SIMD optimized implementation of the HLL and HLL++ algorithms in Rust
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."