RedisBloom / t-digest-cLinks
Wicked Fast, Accurate Quantiles Using 'T-Digests'
☆21Updated 2 years ago
Alternatives and similar repositories for t-digest-c
Users that are interested in t-digest-c are comparing it to the libraries listed below
Sorting:
- simd enabled column imprints☆11Updated 7 years ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆55Updated 4 years ago
- ☆12Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆49Updated 2 months ago
- Adaptive Radix Tree in C++☆45Updated 2 weeks ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- Memtier benchmark front-end☆9Updated 2 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆24Updated last month
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆10Updated last month
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- TSXor: A Simple Time Series Compression Algorithm☆53Updated 4 months ago
- Embedded DB Benchmark Framework☆60Updated 4 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- Lightning In-Memory Object Store☆46Updated 3 years ago
- My take on the LMAX Disruptor☆75Updated 12 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Raft Consensus Algorithm Implementation in C++ (11)☆25Updated 10 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- A distributed database benchmark based on TAO's workload☆40Updated last year
- Succinct C++☆24Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Multi-core Window-Based Stream Processing Engine☆71Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)