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
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ☆53Updated last year
- ☆47Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆58Updated last month
- An open-source BzTree implementation☆92Updated 3 years ago
- Adaptive Radix Tree in C++☆45Updated this week
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆54Updated 3 weeks ago
- ☆12Updated 3 years ago
- ☆38Updated 4 years ago
- ☆28Updated 2 years ago
- ☆70Updated 2 months 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
- Quickstep project☆42Updated 6 months ago
- The Cicada engine☆57Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- ☆12Updated 6 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago