axiomhq / hyperminhashLinks
HyperMinHash: Bringing intersections to HyperLogLog
☆306Updated 7 years ago
Alternatives and similar repositories for hyperminhash
Users that are interested in hyperminhash are comparing it to the libraries listed below
Sorting:
- Optimal Quantile Approximation in Streams☆163Updated 2 years ago
- Go implementation of MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams☆188Updated 5 years ago
- ☆37Updated 7 years ago
- Quickly detect already witnessed data.☆156Updated last year
- UI for interactive data analysis | https://snorkel.logv.org☆166Updated last year
- Implementations of a data structure with false negatives but no false positives.☆358Updated last year
- HyperBitBit☆134Updated 8 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- Mmap radix sort file by a fixed length prefix of each line☆52Updated 5 years ago
- Demonstrating the importance of laying out data in memory.☆47Updated 7 years ago
- A learned index structure☆53Updated 4 years ago
- Pilosa Dev Kit - implementation tooling and use case examples are here!☆31Updated 3 years ago
- S3 backed key/value database for infrequent read access☆171Updated 7 years ago
- C network daemon for HyperLogLogs☆451Updated 4 years ago
- columnar storage + NoSQL OLAP engine | https://logv.org☆307Updated last year
- Probabilistic Multiplicity Counting☆49Updated 10 years ago
- Consus is a geo-replicated transactional key-value store.☆227Updated 7 years ago
- An apporximate frequency counter Redis module☆46Updated 6 years ago
- ASAP: Prioritizing Attention via Time Series Smoothing☆195Updated 7 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆129Updated 2 years ago
- LogLog based Cardinality Estimator☆63Updated 8 years ago
- A totally proof-of-concept FoundationDB based network block device backend☆114Updated 7 years ago
- t-digest module for Redis☆72Updated 4 years ago
- Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS☆91Updated 6 months ago
- Python implementations of the distributed quantile sketch algorithm DDSketch☆89Updated 6 months ago
- Query engine for TrailDB☆51Updated 6 years ago
- Fabric is a simple triplestore written in Golang☆198Updated 3 years ago
- A Directed Acyclic Graph task dependency scheduler designed to simplify complex distributed pipelines☆131Updated 7 years ago
- hokusai -- sketching streams in real-time☆77Updated 8 years ago
- poor man's kafka (plus in-place mutations and search)☆109Updated 3 years ago