oertl / hyperloglog-sketch-estimation-paperView external linksLinks
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
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 6 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Aug 11, 2021Updated 4 years ago
- Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing☆32Jun 11, 2017Updated 8 years ago
- A benchmark for generic, large-scale shuffle operations on continuous stream of data, implemented with state-of-the-art stream processing…☆14Updated this week
- Materials for a workshop on hash-based sketches☆12Sep 30, 2022Updated 3 years ago
- Metrics gathering thingy☆11Jul 17, 2019Updated 6 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Oct 26, 2020Updated 5 years ago
- Just another minhash implementation.☆12Updated this week
- ☆10Jun 16, 2022Updated 3 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 2 months 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
- Johns Hopkins University student-led genomics paper discussion group☆13Apr 19, 2020Updated 5 years ago
- A Rust library for building modular, fast and compact indexes over genomic data☆12Nov 22, 2023Updated 2 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆14Oct 2, 2011Updated 14 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Mar 18, 2020Updated 5 years ago
- Tools for working FASTQ files from sequencers (R1/R2/I1/I2)☆12Dec 6, 2024Updated last year
- MISSION: Ultra Large-Scale Feature Selection using Count-Sketches☆13Oct 6, 2019Updated 6 years ago
- ☆18Dec 26, 2025Updated last month
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Oct 15, 2021Updated 4 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆40Jul 20, 2018Updated 7 years ago
- A demo of concurrency primitives in x64 assembly☆18Jan 6, 2022Updated 4 years ago
- Library to program with streams, events, and to queue own functions into a stream.☆15Jan 23, 2026Updated 3 weeks ago
- PANENE: Progressive Approximate NEarest NEighbors☆19Feb 12, 2025Updated last year
- A HyperMinHash implementation for Redis.☆19Sep 20, 2019Updated 6 years ago
- Implementation of Frequent-Directions algorithm for efficient matrix sketching [E. Liberty, SIGKDD2013]☆27Apr 19, 2015Updated 10 years ago
- ☆15Nov 30, 2023Updated 2 years ago
- A HyperLogLog implementation in Rust.☆52Updated this week
- Dynamic succinct/compressed data structures☆115Dec 17, 2025Updated last month
- HyperMinHash: Bringing intersections to HyperLogLog☆308Mar 9, 2018Updated 7 years ago
- GBWT in Rust☆45Dec 26, 2025Updated last month
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- Roaring bitmaps in C☆17Mar 8, 2016Updated 9 years ago
- SuperMinHash: A New Minwise Hashing Algorithm for Jaccard Similarity Estimation☆25Jan 1, 2018Updated 8 years ago
- ☆20Aug 18, 2020Updated 5 years ago
- A ball-tree implementation for K-NN☆18Jan 8, 2026Updated last month
- A crate for estimating the cardinality of distinct elements in a stream or dataset.☆29Feb 18, 2025Updated 11 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago