axiomhq / hyperminhash
HyperMinHash: Bringing intersections to HyperLogLog
☆304Updated 7 years ago
Alternatives and similar repositories for hyperminhash:
Users that are interested in hyperminhash are comparing it to the libraries listed below
- Optimal Quantile Approximation in Streams☆163Updated 2 years ago
- Implementations of a data structure with false negatives but no false positives.☆357Updated last year
- Go implementation of MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams☆188Updated 4 years ago
- Quickly detect already witnessed data.☆157Updated 8 months ago
- HyperBitBit☆133Updated 8 years ago
- ☆37Updated 6 years ago
- LogLog based Cardinality Estimator☆62Updated 7 years ago
- A general-purpose data analysis engine radically changing the way batch and stream data is processed☆7Updated 6 years ago
- S3 backed key/value database for infrequent read access☆170Updated 7 years ago
- Probabilistic Multiplicity Counting☆49Updated 9 years ago
- Go implementations of the distributed quantile sketch algorithm DDSketch☆173Updated last month
- Python implementations of the distributed quantile sketch algorithm DDSketch☆86Updated 7 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Updated 7 years ago
- hokusai -- sketching streams in real-time☆78Updated 7 years ago
- BigTable, Document and Graph Database with Full Text Search☆186Updated 7 years ago
- Distributed Named Pipes☆455Updated 7 years ago
- Fabric is a simple triplestore written in Golang☆197Updated 2 years ago
- UI for interactive data analysis | https://snorkel.logv.org☆163Updated last year
- Interactive visualization framework for Runway models of distributed systems☆187Updated 3 years ago
- Cantor provides utilities for estimating the cardinality of large sets.☆83Updated 2 years ago
- Pilosa Dev Kit - implementation tooling and use case examples are here!☆31Updated 2 years ago
- A learned index structure☆53Updated 4 years ago
- C network daemon for HyperLogLogs☆449Updated 4 years ago
- Mmap radix sort file by a fixed length prefix of each line☆52Updated 4 years ago
- Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams☆242Updated 8 years ago
- Demonstrating the importance of laying out data in memory.☆47Updated 7 years ago
- A key/value store for serving static batch data☆175Updated last year
- t-digest module for Redis☆73Updated 4 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago