coolwanglu / quantile-alg
Algorithms for finding quantiles of a data stream
☆19Updated 11 years ago
Alternatives and similar repositories for quantile-alg:
Users that are interested in quantile-alg are comparing it to the libraries listed below
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆44Updated last year
- Cluster computing using Stateful Dataflow Graphs☆26Updated 2 years ago
- An HFile-backed Key-Value Server☆43Updated 6 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆10Updated 7 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆54Updated 2 years ago
- Moments Sketch Code☆40Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Paxos protocol variants framework☆26Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- A clustered, masterless redis clone, built in Go☆31Updated 10 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014☆71Updated 10 years ago
- The Musketeer workflow manager.☆41Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Diviner is a serverless machine learning and hyper parameter tuning platform☆22Updated 5 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…☆50Updated 6 years ago
- Factable is a service for reporting over event-sourced application data☆12Updated 4 years ago
- Streaming estimation of percentiles, especially high percentiles.☆63Updated 12 years ago
- Source of paper “A critique of the CAP theorem”☆16Updated 9 years ago
- A Lock-Free Concurrent Hash Table☆20Updated 14 years ago
- Wicked Fast, Accurate Quantiles Using 'T-Digests'☆21Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Memory Efficient Quantile Approximator for High Speed Data Streams☆22Updated 8 years ago
- Experiments on bit-slice indexing☆13Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Deterministic transactional database layer on top of a stream processing engine☆25Updated 5 years ago
- ☆15Updated 10 years ago