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☆154Updated 7 years ago
- ☆121Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- ☆148Updated 2 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 8 months ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆127Updated 3 months ago
- Benchmarking framework for index structures on persistent memory☆88Updated 2 years ago
- ☆29Updated 5 years ago
- A version of RocksDB that uses persistent memory☆92Updated 8 months ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆163Updated 3 years ago
- ☆70Updated 3 months ago
- Key/Value Datastore for Persistent Memory☆400Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆92Updated 2 years ago
- 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 8 months ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- ☆289Updated 2 years ago
- Key Value Development Kit☆202Updated 8 months ago
- pmwcas☆139Updated 2 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 4 years ago