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
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- ☆143Updated 2 years ago
- ☆117Updated 3 years ago
- LSM-trie☆113Updated 4 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- The Cicada engine☆55Updated 7 years ago
- Beta release of Masstree.☆441Updated last year
- A version of RocksDB that uses persistent memory☆92Updated 5 months ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆90Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 2 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 6 months ago
- pmwcas☆137Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆99Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆43Updated 3 years ago
- MemKeyDB is a fork of Redis, adjusted to store objects on both Intel Optane Persistent Memory and DRAM.☆78Updated 9 months ago
- An adaptive radix tree for efficient indexing in main memory.☆156Updated last year
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆114Updated 2 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- HOT - Height Optimized Trie☆148Updated 7 years ago
- Log-Structured Merge-Tree (LSM-Tree)☆89Updated 8 years ago
- Key Value Store based on LevelDB☆112Updated 3 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 10 years ago
- SPDK RocksDB mirror☆33Updated 8 months ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago