caetanosauer / foster-btreeLinks
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
Sorting:
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- ☆20Updated 2 years ago
- ☆12Updated 6 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)☆21Updated 2 years ago
- Adaptive Radix Tree in C++☆45Updated last week
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- ☆47Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆58Updated last month
- ☆12Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆30Updated 6 years ago
- The Cicada engine☆57Updated 7 years ago
- ☆28Updated 2 years ago
- HOT - Height Optimized Trie☆151Updated 7 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- ☆53Updated last year
- An implementation of various in-memory concurrency control protocols☆24Updated last year
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆38Updated 4 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
- 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
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆55Updated last month
- Concurrency Control Benchmark☆48Updated last year
- FOEDUS main source code repository☆63Updated 7 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 6 years ago