oscarlab / Be-TreeLinks
A simple, reference implementation of a B^e-tree
☆157Updated 6 years ago
Alternatives and similar repositories for Be-Tree
Users that are interested in Be-Tree are comparing it to the libraries listed below
Sorting:
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆81Updated 3 years ago
- pmwcas☆139Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- The Cicada engine☆59Updated 8 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- HOT - Height Optimized Trie☆155Updated 7 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- ☆121Updated 3 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆150Updated 2 years ago
- QSBR and EBR library☆124Updated 5 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆195Updated 10 months ago
- Remote Persistent Memory Access Library☆104Updated 2 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Order-preserving key encoder☆124Updated 5 years ago
- NOPaxos consensus protocol☆136Updated 4 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- ☆141Updated 3 years ago
- ☆54Updated last year
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Software Transactional Objects☆58Updated last year
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago