rmind / masstreeLinks
Masstree -- lockless cache-aware trie of B+ trees [experimental]
☆100Updated 7 years ago
Alternatives and similar repositories for masstree
Users that are interested in masstree are comparing it to the libraries listed below
Sorting:
- The Cicada engine☆59Updated 8 years ago
- Beta release of Masstree.☆446Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- LSM-trie☆114Updated 4 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆211Updated 9 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- ☆122Updated 3 years ago
- ☆149Updated 2 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
- 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
- HOT - Height Optimized Trie☆156Updated 7 years ago
- A transactional main-memory database system on multicores☆104Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- Multicore in-memory storage engine☆394Updated 8 years ago
- Key Value Store based on LevelDB☆115Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- pmwcas☆138Updated 2 years ago
- Log-Structured Merge-Tree (LSM-Tree)☆89Updated 8 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- NOPaxos consensus protocol☆138Updated 4 years ago
- QSBR and EBR library☆127Updated 5 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Updated 2 years ago
- ☆44Updated 4 years ago
- A fast in-memory key-value store☆51Updated 8 years ago