coolwanglu / quantile-algLinks
Algorithms for finding quantiles of a data stream
☆20Updated 12 years ago
Alternatives and similar repositories for quantile-alg
Users that are interested in quantile-alg are comparing it to the libraries listed below
Sorting:
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 3 years ago
- Simplified Moment Sketch Implemntation☆36Updated 7 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- Moments Sketch Code☆40Updated 7 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆45Updated 2 years ago
- Wicked Fast, Accurate Quantiles Using 'T-Digests'☆23Updated 3 months ago
- A C++ library for summarizing data streams☆23Updated 6 years ago
- Bloom + C++☆17Updated 8 years ago
- An HFile-backed Key-Value Server☆43Updated 6 years ago
- Iterator library.☆80Updated 6 years ago
- ☆50Updated 5 years ago
- Query engine for TrailDB☆51Updated 7 years ago
- A compiler and runtime for the Sawzall language☆70Updated 6 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Updated 9 years ago
- Python implementations of the distributed quantile sketch algorithm DDSketch☆89Updated last week
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 4 years ago
- High-performance dictionary coding☆109Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Experiments on bit-slice indexing☆13Updated 10 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Updated 5 years ago
- Your worst case is our best case.☆144Updated 8 years ago
- The Musketeer workflow manager.☆42Updated 7 years ago
- Streaming estimation of percentiles, especially high percentiles.☆63Updated 13 years ago
- Locality Sensitive Hashing using Golang and SQL database☆27Updated 9 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Updated 13 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 10 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Updated 3 years ago
- Perseus is a set of scripts (docker+javascript) to investigate a distributed database's responsiveness when one of its three nodes is iso…☆49Updated 6 years ago
- alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.☆49Updated 4 years ago
- ☆37Updated 5 years ago