laurynas-biveinis / unodbLinks
Adaptive Radix Tree in C++
☆45Updated last week
Alternatives and similar repositories for unodb
Users that are interested in unodb are comparing it to the libraries listed below
Sorting:
- ☆20Updated 2 years ago
- An open-source BzTree implementation☆92Updated 3 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
- Embedded InnoDB based on v5.1☆32Updated 2 months ago
- Quickstep project☆42Updated 7 months ago
- ☆12Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ☆136Updated 2 years ago
- ☆29Updated 2 years ago
- ☆54Updated last year
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆47Updated last year
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 3 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 2 months ago
- ☆120Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- In-memory, columnar, arrow-based database.☆47Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆60Updated 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
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- A toy memory store with great performance☆35Updated 3 years ago
- ☆14Updated 2 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- ☆14Updated 3 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
- Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"☆22Updated 11 months ago