rafaelkallis / adaptive-radix-treeLinks
An adaptive radix tree for efficient indexing in main memory.
☆161Updated 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☆153Updated 7 years ago
- ☆120Updated 3 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- ☆146Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆173Updated 8 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆56Updated last month
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 2 months ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- Quickstep project☆42Updated 7 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- ☆43Updated 3 years ago
- A data structure and algorithm library built for TerarkDB☆64Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆160Updated 3 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 4 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆200Updated last year
- Order-preserving key encoder☆122Updated 5 years ago
- A version of RocksDB that uses persistent memory☆92Updated 7 months ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 8 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆162Updated 4 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago