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
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- 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
- A HyperLogLog implementation in Rust.☆52Feb 9, 2026Updated 2 months ago
- ☆17Jun 26, 2024Updated last year
- A set of distinct value estimators that give probabilistic bounds on a sets cardinality☆22Dec 9, 2019Updated 6 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Mar 18, 2020Updated 6 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Just another minhash implementation.☆12Mar 12, 2026Updated last month
- Implementation of Bayesian Sets for fast similarity searches.☆14Oct 2, 2011Updated 14 years ago
- 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
- Tools for working FASTQ files from sequencers (R1/R2/I1/I2)☆12Dec 6, 2024Updated last year
- Rust crate with bindings and interface to the SPOA library for generating consensus sequences.☆13Apr 16, 2019Updated 7 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 4 months ago
- ☆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
- Metrics gathering thingy☆11Jul 17, 2019Updated 6 years ago
- A HyperMinHash implementation for Redis.☆19Sep 20, 2019Updated 6 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
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 4 months ago
- Library and accelerator backend☆15Updated this week
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 7 years ago
- Roaring bitmaps in C☆17Mar 8, 2016Updated 10 years ago
- PANENE: Progressive Approximate NEarest NEighbors☆20Feb 12, 2025Updated last year
- Be Truly Awesome☆12Oct 18, 2015Updated 10 years ago
- ☆10Feb 23, 2024Updated 2 years ago