caetanosauer / fineline-zero
☆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
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆52Updated 9 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- ☆20Updated 2 years ago
- The Cicada engine☆55Updated 7 years ago
- Quickstep project☆42Updated 3 months ago
- ☆37Updated 4 years ago
- Dependably fast multi-core in-memory transactions☆19Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- ☆27Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆29Updated 6 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- simd enabled column imprints☆11Updated 7 years 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
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- Adaptive Radix Tree in C++☆41Updated this week
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- ☆116Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- ☆10Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- ☆40Updated 10 months ago
- ☆14Updated last year
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 5 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆43Updated last year
- ☆24Updated 2 years ago