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:
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Adaptive Radix Tree in C++☆47Updated this week
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆48Updated last year
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- ☆74Updated 2 months ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆68Updated 2 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 6 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- The Cicada engine☆59Updated 8 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- ☆55Updated last year
- ☆38Updated 5 years ago
- Library for lock-free locks☆83Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆144Updated 3 years ago
- ☆12Updated 6 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…☆125Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 years ago
- ☆12Updated 4 years ago
- ☆30Updated 3 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆70Updated last year
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago