flode / BwTreeLinks
Implementation of the BwTree as specified by Microsoft Research
☆100Updated 9 years ago
Alternatives and similar repositories for BwTree
Users that are interested in BwTree are comparing it to the libraries listed below
Sorting:
- An open-source BzTree implementation☆92Updated 4 years ago
- The Cicada engine☆58Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- ☆121Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆149Updated 2 years ago
- pmwcas☆139Updated 2 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- ☆44Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- ☆29Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 10 months ago
- A simple, reference implementation of a B^e-tree☆156Updated 6 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 4 months ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Updated 2 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆201Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆63Updated 3 months ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆73Updated last year
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- C++ fast transactional key-value storage.☆170Updated last week
- Scalable Hashing on Persistent Memory☆194Updated last year
- Beta release of Masstree.☆444Updated last year
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago