Paper about the estimation of cardinalities from HyperLogLog sketches
☆65May 18, 2021Updated 5 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 6 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆17Aug 3, 2025Updated last year
- Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing☆32Jun 11, 2017Updated 9 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Aug 11, 2021Updated 5 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Jul 23, 2024Updated 2 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- 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…☆15Apr 21, 2026Updated 5 months ago
- HyperMinHash: Bringing intersections to HyperLogLog☆308Mar 9, 2018Updated 8 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Feb 19, 2020Updated 6 years ago
- NetBSD cdb (constant database) library☆14May 24, 2019Updated 7 years ago
- Materials for a workshop on hash-based sketches☆12Sep 30, 2022Updated 3 years ago
- A HyperLogLog implementation in Rust.☆52Feb 9, 2026Updated 7 months ago
- SeqOthello supports fast coverage query and containment query.☆12May 8, 2019Updated 7 years ago
- Metrics gathering thingy☆11Jul 17, 2019Updated 7 years 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.
- Implementation of Bayesian Sets for fast similarity searches.☆14Oct 2, 2011Updated 14 years ago
- Just another minhash implementation.☆13Sep 14, 2026Updated last week
- ☆10Jun 16, 2022Updated 4 years ago
- Tools for working FASTQ files from sequencers (R1/R2/I1/I2)☆12Dec 6, 2024Updated last year
- Library and accelerator backend☆15Updated this week
- Rust crate with bindings and interface to the SPOA library for generating consensus sequences.☆13Apr 16, 2019Updated 7 years ago
- ☆18Jul 21, 2026Updated 2 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 9 months ago
- Sketch-based surveillance platform☆13Aug 14, 2026Updated last month
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆40Jul 20, 2018Updated 8 years ago
- A Rust implementation of HyperLogLog trying to be parsimonious with memory.☆35Sep 6, 2026Updated 2 weeks ago
- ☆15Nov 6, 2018Updated 7 years ago
- 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
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 9 months ago
- Roaring bitmaps in C☆17Mar 8, 2016Updated 10 years ago
- Parallel sections library for parallel data-structures☆15Aug 30, 2026Updated 3 weeks ago
- Be Truly Awesome☆12Oct 18, 2015Updated 10 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- PANENE: Progressive Approximate NEarest NEighbors☆20Feb 12, 2025Updated last year
- SuperMinHash: A New Minwise Hashing Algorithm for Jaccard Similarity Estimation☆25Jan 1, 2018Updated 8 years ago
- A set of distinct value estimators that give probabilistic bounds on a sets cardinality☆22Dec 9, 2019Updated 6 years ago
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 7 years ago
- Probabilistic Multiplicity Counting☆49Sep 29, 2015Updated 10 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 4 years ago
- A HyperMinHash implementation for Redis.☆19Sep 20, 2019Updated 7 years ago