rmind / masstree
Masstree -- lockless cache-aware trie of B+ trees [experimental]
☆100Updated 6 years ago
Alternatives and similar repositories for masstree:
Users that are interested in masstree are comparing it to the libraries listed below
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- The Cicada engine☆57Updated 7 years ago
- ☆143Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆89Updated 2 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- ☆119Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- Beta release of Masstree.☆441Updated last year
- 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 8 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- pmwcas☆137Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 6 months ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- ☆43Updated 3 years ago
- A version of RocksDB that uses persistent memory☆92Updated 6 months ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- Log-Structured Merge-Tree (LSM-Tree)☆89Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- QSBR and EBR library☆119Updated 5 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆176Updated 3 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆100Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆159Updated last year
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆179Updated 7 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆94Updated 5 years ago
- MemKeyDB is a fork of Redis, adjusted to store objects on both Intel Optane Persistent Memory and DRAM.☆77Updated 10 months ago