rafaelkallis / adaptive-radix-tree
An adaptive radix tree for efficient indexing in main memory.
☆159Updated 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
- HOT - Height Optimized Trie☆149Updated 7 years ago
- ☆119Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- ☆143Updated 2 years ago
- A version of RocksDB that uses persistent memory☆92Updated 6 months ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 6 months ago
- An embedded key-value store library specialized for building state machine and log store☆229Updated this week
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆99Updated 2 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆90Updated 2 years ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- An open-source BzTree implementation☆92Updated 3 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆57Updated 2 weeks ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆198Updated last year
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆213Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆53Updated this week
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆160Updated 4 years ago
- ☆29Updated 5 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 4 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- Quickstep project☆42Updated 5 months ago
- A data structure and algorithm library built for TerarkDB☆62Updated 3 years ago