RedisBloom / t-digest-cLinks
Wicked Fast, Accurate Quantiles Using 'T-Digests'
☆23Updated 2 months 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:
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆56Updated 5 years ago
- An embedded key-value store library specialized for building state machine and log store☆236Updated last week
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- A toy memory store with great performance☆37Updated last month
- Embedded DB Benchmark Framework☆62Updated 5 years ago
- TSXor: A Simple Time Series Compression Algorithm☆53Updated 11 months ago
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆107Updated 5 months ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆82Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48Updated 2 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Updated last month
- Adaptive Radix Tree in C++☆50Updated this week
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- C++ implementation of HyperLogLog☆61Updated last year
- Persistent Memory Storage Engine☆24Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- Multi-core Window-Based Stream Processing Engine☆73Updated 4 years ago
- A Raft Library in C++ based on the Raft implementation in Apache Kudu☆142Updated this week
- This is an implementation of a log structure merge tree.☆59Updated 8 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆50Updated 9 months ago
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- A distributed database benchmark based on TAO's workload☆44Updated 2 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- ☆121Updated 2 years ago
- Fast Redis clone written in C using RocksDB as a backend.☆75Updated 4 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- Filesystem qualification tool☆60Updated last month
- ☆12Updated 7 years ago