rmind / masstree
Masstree -- lockless cache-aware trie of B+ trees [experimental]
☆97Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for masstree
- Implementation of the BwTree as specified by Microsoft Research☆98Updated 8 years ago
- ☆142Updated last year
- The Cicada engine☆56Updated 7 years ago
- A transactional main-memory database system on multicores☆102Updated 6 years ago
- LSM-trie☆114Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆87Updated last year
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆172Updated 8 years ago
- pmwcas☆135Updated last year
- Log-Structured Merge-Tree (LSM-Tree)☆89Updated 7 years ago
- Beta release of Masstree.☆432Updated last year
- ☆115Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆76Updated 2 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆204Updated 8 years ago
- ☆43Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- An open-source BzTree implementation☆90Updated 3 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆112Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Updated last month
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆86Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆150Updated 8 months ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- A version of RocksDB that uses persistent memory☆92Updated 2 weeks ago
- Key Value Store based on LevelDB☆110Updated 3 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 10 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆96Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆149Updated 3 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- NVM Evaluation Testbed☆28Updated 6 years ago
- QSBR and EBR library☆116Updated 4 years ago