HyperMinHash: Bringing intersections to HyperLogLog
☆309Mar 9, 2018Updated 8 years ago
Alternatives and similar repositories for hyperminhash
Users that are interested in hyperminhash are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆37Aug 29, 2018Updated 7 years ago
- HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom☆1,044Updated this week
- SuperMinHash: A New Minwise Hashing Algorithm for Jaccard Similarity Estimation☆25Jan 1, 2018Updated 8 years ago
- Optimal Quantile Approximation in Streams☆162Feb 15, 2023Updated 3 years ago
- HyperBitBit☆135Mar 21, 2017Updated 9 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.
- d-left Counting Bloom Filter☆55Aug 21, 2015Updated 10 years ago
- A counter data structure that knows when to start estimating to save space☆34Oct 9, 2017Updated 8 years ago
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Jun 3, 2017Updated 9 years ago
- LogLog based Cardinality Estimator☆63Nov 14, 2017Updated 8 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Feb 19, 2020Updated 6 years ago
- Go implementation of ntHash☆20Sep 16, 2021Updated 4 years ago
- Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing☆32Jun 11, 2017Updated 9 years ago
- A probabilistic data structure service and storage☆773May 10, 2016Updated 10 years ago
- Moments Sketch Code☆41Oct 31, 2018Updated 7 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.
- Paper about the estimation of cardinalities from HyperLogLog sketches☆65May 18, 2021Updated 5 years ago
- Go translation of MetroHash☆118Jan 6, 2025Updated last year
- HyperLogLog and HyperLogLog++ implementation in Go/Golang.☆462Oct 16, 2019Updated 6 years ago
- Adaptive version of KMV algorithm for cardinality estimation☆23May 5, 2019Updated 7 years ago
- A crazy fast analytical database, built on bitmaps. Perfect for ML applications. Learn more at: http://docs.featurebase.com/. Start a Doc…☆2,524Feb 21, 2024Updated 2 years ago
- Utility to scan your Redis instance☆14May 26, 2016Updated 10 years ago
- A fast collection type that uses uint64 for keys.☆44Nov 3, 2020Updated 5 years ago
- ☆18Jul 21, 2026Updated last week
- BottomK minwise hashing for streaming set similarity☆44Mar 15, 2019Updated 7 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.
- A HyperMinHash implementation for Redis.☆19Sep 20, 2019Updated 6 years ago
- Go implementations of the distributed quantile sketch algorithm DDSketch☆186Jun 24, 2026Updated last month
- Go implementation of Count-Min-Log☆70Mar 4, 2025Updated last year
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆45Jun 10, 2023Updated 3 years ago
- Cantor provides utilities for estimating the cardinality of large sets.☆85Apr 12, 2022Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆89Jan 25, 2024Updated 2 years ago
- A probabilistic data structure for frequency/k-occurrence cardinality estimation of multisets.☆171Jan 16, 2015Updated 11 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Aug 11, 2021Updated 4 years ago
- C++11 library for fast fuzzy searching☆15Jun 9, 2015Updated 11 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.
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆156Jul 23, 2024Updated 2 years ago
- Counter Data structure for Golang using CountMin Sketch with a fixed amount of memory☆45Jan 4, 2018Updated 8 years ago
- ☆12Nov 19, 2016Updated 9 years ago
- Go library implementing binary fuse and xor filters☆763Jan 26, 2026Updated 6 months ago
- A high performance in-memory index storage engine☆113Updated this week
- A Go library for advanced searching in sorted data structures☆22Jul 18, 2018Updated 8 years ago
- An implementation of HLL++ in go☆71Oct 15, 2018Updated 7 years ago