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:
- ☆48Updated last year
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆20Updated 2 years ago
- An implementation of various in-memory concurrency control protocols☆26Updated last year
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- The Cicada engine☆59Updated 8 years ago
- ☆30Updated 3 years ago
- C++ fast transactional key-value storage.☆171Updated last week
- Adaptive Radix Tree in C++☆47Updated last week
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆26Updated 4 months ago
- ☆72Updated 3 weeks ago
- ☆12Updated 6 years ago
- ☆55Updated last year
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Concurrency Control Benchmark☆48Updated 2 years ago
- a high performance cache simulator and library☆109Updated last year
- pmwcas☆138Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆65Updated 3 weeks ago
- ☆38Updated 5 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 3 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 5 months ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆30Updated 6 years ago