runshenzhu / palmtreeLinks
An implementation of Intel's concurrent B+Tree (Palm Tree)
☆175Updated 9 years ago
Alternatives and similar repositories for palmtree
Users that are interested in palmtree are comparing it to the libraries listed below
Sorting:
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- ☆121Updated 3 years ago
- ☆149Updated 2 years ago
- Beta release of Masstree.☆442Updated last year
- HOT - Height Optimized Trie☆156Updated 7 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- The Cicada engine☆57Updated 8 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 9 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- pmwcas☆139Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- A working project for High-concurrency B-tree source code in C☆251Updated 4 years ago
- Key/Value Datastore for Persistent Memory☆403Updated 2 years ago
- Multicore in-memory storage engine☆389Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- ☆44Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 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
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- An embedded key-value store library specialized for building state machine and log store☆233Updated last month
- The PebblesDB write-optimized key-value store (SOSP 17)☆515Updated last year
- A simple, reference implementation of a B^e-tree☆155Updated 6 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
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- ☆290Updated 2 years ago