L-v-M / asyncLinks
☆20Updated 3 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
- ☆50Updated last year
- Adaptive Radix Tree in C++☆50Updated this week
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- The Cicada engine☆59Updated 8 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆70Updated last month
- ☆81Updated 5 months ago
- ☆57Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 9 months ago
- ☆30Updated 3 years ago
- ☆12Updated 7 years ago
- ☆39Updated 5 years ago
- ☆12Updated 4 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆28Updated 2 years ago
- ☆148Updated 3 years ago
- Quickstep project☆44Updated last year
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 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…☆127Updated last year
- HOT - Height Optimized Trie☆158Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- Library for lock-free locks☆84Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆138Updated last month