laurynas-biveinis / unodbLinks
Adaptive Radix Tree in C++
☆48Updated last week
Alternatives and similar repositories for unodb
Users that are interested in unodb are comparing it to the libraries listed below
Sorting:
- An open-source BzTree implementation☆92Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆20Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- ☆12Updated 7 years ago
- Embedded InnoDB based on v5.1☆34Updated 2 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆27Updated last year
- ☆49Updated last year
- ☆145Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆167Updated last month
- ☆30Updated 3 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆69Updated 3 months ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 8 months ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48Updated 2 years ago
- ☆39Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆83Updated 3 years ago
- The Cicada engine☆59Updated 8 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 9 months ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 4 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Quickstep project☆44Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- ☆30Updated 3 months ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆160Updated 6 years ago