Paper about the estimation of cardinalities from HyperLogLog sketches
☆64May 18, 2021Updated 4 years ago
Alternatives and similar repositories for hyperloglog-sketch-estimation-paper
Users that are interested in hyperloglog-sketch-estimation-paper are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Aug 26, 2020Updated 5 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆17Aug 3, 2025Updated 8 months ago
- Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing☆32Jun 11, 2017Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Aug 11, 2021Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆158Jul 23, 2024Updated last year
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Oct 26, 2020Updated 5 years ago
- A benchmark for generic, large-scale shuffle operations on continuous stream of data, implemented with state-of-the-art stream processing…☆14Apr 21, 2026Updated last week
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Feb 19, 2020Updated 6 years ago
- Materials for a workshop on hash-based sketches☆12Sep 30, 2022Updated 3 years ago
- SeqOthello supports fast coverage query and containment query.☆12May 8, 2019Updated 6 years ago
- NetBSD cdb (constant database) library☆14May 24, 2019Updated 6 years ago
- ☆17Jun 26, 2024Updated last year
- Minhash Index Extended to Knead Kmer Intersection☆11Mar 18, 2020Updated 6 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆14Oct 2, 2011Updated 14 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- EWAH Compressed Bitmaps☆25Sep 25, 2020Updated 5 years ago
- Dynatrace FM-Index library☆16Nov 11, 2025Updated 5 months ago
- ☆15Nov 6, 2018Updated 7 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆309Mar 9, 2018Updated 8 years ago
- ☆10Jun 16, 2022Updated 3 years ago
- Rust crate with bindings and interface to the SPOA library for generating consensus sequences.☆13Apr 16, 2019Updated 7 years ago
- Sketch-based surveillance platform☆14Dec 17, 2024Updated last year
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆23Sep 16, 2022Updated 3 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 4 months ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- ☆18Apr 18, 2026Updated last week
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆40Jul 20, 2018Updated 7 years ago
- A Rust implementation of HyperLogLog trying to be parsimonious with memory.☆33Sep 24, 2024Updated last year
- A Rust library for building modular, fast and compact indexes over genomic data☆12Nov 22, 2023Updated 2 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Apr 19, 2020Updated 6 years ago
- A demo of concurrency primitives in x64 assembly☆18Jan 6, 2022Updated 4 years ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 4 months ago
- Traversable Python Dictionaries☆59Dec 26, 2022Updated 3 years ago
- Library and accelerator backend☆15Updated this week
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 7 years ago
- PANENE: Progressive Approximate NEarest NEighbors☆20Feb 12, 2025Updated last year
- ☆10Feb 23, 2024Updated 2 years ago
- Event streaming queue☆11Mar 29, 2021Updated 5 years ago
- Haskell binding for Menoh DNN inference library☆12Nov 30, 2018Updated 7 years ago
- Pipeline for Evaluating Prokaryotic References☆11Sep 16, 2016Updated 9 years ago
- An implementation of HLL++ in go☆71Oct 15, 2018Updated 7 years ago