runshenzhu / palmtree
An implementation of Intel's concurrent B+Tree (Palm Tree)
☆172Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for palmtree
- Implementation of the BwTree as specified by Microsoft Research☆98Updated 8 years ago
- An adaptive radix tree for efficient indexing in main memory.☆150Updated 8 months ago
- ☆142Updated last year
- ☆115Updated 2 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- pmwcas☆135Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Updated last month
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆246Updated 2 years ago
- A transactional main-memory database system on multicores☆102Updated 6 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆149Updated 3 years ago
- LSM-trie☆114Updated 3 years ago
- An open-source BzTree implementation☆90Updated 3 years ago
- Key Value Store based on LevelDB☆110Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆97Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆87Updated last year
- The Cicada engine☆56Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- ☆43Updated 3 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆41Updated last year
- 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
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆86Updated last year
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 3 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆96Updated last year
- Scalable Hashing on Persistent Memory☆187Updated 7 months ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆112Updated last year
- Beta release of Masstree.☆432Updated last year
- A version of RocksDB that uses persistent memory☆92Updated 2 weeks ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆47Updated last month
- A working project for High-concurrency B-tree source code in C☆246Updated 4 years ago
- Benchmarking framework for index structures on persistent memory☆87Updated last year