sfu-dis / bztreeLinks
An open-source BzTree implementation
☆92Updated 4 years ago
Alternatives and similar repositories for bztree
Users that are interested in bztree are comparing it to the libraries listed below
Sorting:
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆63Updated 3 months ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 4 months ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 10 months ago
- Benchmarking framework for index structures on persistent memory☆88Updated 2 years ago
- ☆121Updated 3 years ago
- pmwcas☆139Updated 2 years ago
- The Cicada engine☆58Updated 8 years ago
- ☆149Updated 2 years ago
- ☆29Updated 2 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- Software Transactional Objects☆58Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- An open-source FPTree implementation☆27Updated 3 years ago
- Key-value store with new indexing☆37Updated 5 years ago
- ☆48Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated last year
- ☆72Updated 5 months ago
- Scalable Hashing on Persistent Memory☆194Updated 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
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆118Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 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
- ☆54Updated last year