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:
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 6 months ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- ☆149Updated 2 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- pmwcas☆138Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆38Updated 5 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆68Updated 2 months ago
- ☆124Updated 3 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆30Updated 3 years ago
- Key Value Store based on LevelDB☆116Updated 4 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
- Scalable Hashing on Persistent Memory☆193Updated last year
- The Cicada engine☆59Updated 8 years ago
- An open-source FPTree implementation☆27Updated 3 years ago
- Key-value store with new indexing☆37Updated 6 years ago
- A transactional main-memory database system on multicores☆104Updated 7 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 3 years ago
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- A version of RocksDB that uses persistent memory☆93Updated last year
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- ☆74Updated 2 months ago
- ☆55Updated last year
- Software Transactional Objects☆56Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- ☆48Updated last year