caetanosauer / fineline-zeroLinks
☆12Updated 6 years ago
Alternatives and similar repositories for fineline-zero
Users that are interested in fineline-zero are comparing it to the libraries listed below
Sorting:
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 months ago
- ☆30Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- The Cicada engine☆59Updated 8 years ago
- ☆20Updated 2 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
- An open-source BzTree implementation☆92Updated 4 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆47Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆122Updated 3 years ago
- ☆149Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- ☆54Updated last year
- ☆14Updated 2 years ago
- ☆48Updated last year
- ☆38Updated 5 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Quickstep project☆42Updated 11 months ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 7 months 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
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Key Value Store based on LevelDB☆115Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago