caetanosauer / foster-btree
A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
☆15Updated 5 years ago
Alternatives and similar repositories for foster-btree:
Users that are interested in foster-btree are comparing it to the libraries listed below
- ☆20Updated 2 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- ☆40Updated 10 months ago
- ☆12Updated 6 years ago
- ☆37Updated 4 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 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
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- ☆27Updated 2 years ago
- ☆52Updated 9 months ago
- Adaptive Radix Tree in C++☆41Updated this week
- 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
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- An implementation of various in-memory concurrency control protocols☆24Updated 11 months ago
- Artifact for PPoPP'18☆18Updated 2 years ago
- The Cicada engine☆55Updated 7 years ago
- Sphinx is a fast in-memory key-value store, compatible with Memcached.☆32Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆29Updated 6 years ago
- Concurrency Control Benchmark☆47Updated last year
- An open-source BzTree implementation☆91Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 2 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆43Updated 9 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆55Updated 5 months ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆96Updated last year
- ☆14Updated 5 years ago
- Task-based framework for automatic synchronization and memory prefetching.☆18Updated 3 years ago
- HOT - Height Optimized Trie☆143Updated 6 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025)☆42Updated last month