caetanosauer / foster-btreeLinks
A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
☆15Updated 6 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
- ☆50Updated last year
- ☆12Updated 7 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- Adaptive Radix Tree in C++☆50Updated this week
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- An implementation of various in-memory concurrency control protocols☆27Updated last year
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ☆39Updated 5 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48Updated 2 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆31Updated 7 years ago
- The Cicada engine☆59Updated 8 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28Updated 8 months ago
- ☆30Updated 3 years ago
- ☆20Updated 3 years ago
- Concurrency Control Benchmark☆48Updated 2 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- C++ fast transactional key-value storage.☆176Updated this week
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ☆81Updated 4 months ago
- Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"☆25Updated last year
- ☆57Updated last year
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 9 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
- Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index☆82Updated last year
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆70Updated 3 weeks ago
- Sundial: A distributed OLTP database testbed.☆38Updated 5 years ago