rafaelkallis / adaptive-radix-treeLinks
An adaptive radix tree for efficient indexing in main memory.
☆162Updated last year
Alternatives and similar repositories for adaptive-radix-tree
Users that are interested in adaptive-radix-tree are comparing it to the libraries listed below
Sorting:
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆121Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- ☆149Updated 2 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 9 months ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- A transactional main-memory database system on multicores☆104Updated 6 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
- Benchmarking framework for index structures on persistent memory☆88Updated 2 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆128Updated 4 months ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Updated 2 years ago
- ☆30Updated 5 years ago
- A version of RocksDB that uses persistent memory☆93Updated 8 months ago
- Quickstep project☆42Updated 8 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆63Updated 3 months ago
- ☆72Updated 4 months ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 3 months ago
- pmwcas☆139Updated 2 years ago
- Key/Value Datastore for Persistent Memory☆403Updated 2 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- ☆44Updated 3 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆200Updated last year
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆92Updated 2 years ago