L-v-M / asyncLinks
☆20Updated 2 years ago
Alternatives and similar repositories for async
Users that are interested in async are comparing it to the libraries listed below
Sorting:
- An open-source BzTree implementation☆92Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ☆48Updated last year
- Adaptive Radix Tree in C++☆47Updated this week
- ☆54Updated last year
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆66Updated last month
- ☆73Updated last month
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆60Updated 6 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆250Updated 3 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆124Updated last year
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- ☆12Updated 4 years ago
- ☆12Updated 6 years ago
- ☆30Updated 3 years ago
- ☆141Updated 3 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- Quickstep project☆42Updated 11 months ago
- The Cicada engine☆59Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆38Updated 5 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 7 months ago
- ☆28Updated 4 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year