Alternatives and similar repositories for async:

Users that are interested in async are comparing it to the libraries listed below

• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆52Updated 4 months ago
• tuhhosg / exmap
  ☆40Updated 10 months ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆41Updated this week
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 9 months ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025)
  ☆42Updated last month
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆24Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• spcl / vldb19-distributed-locking
  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
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 8 months ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆23Updated last year
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆43Updated 9 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• viktorleis / vmcache
  ☆62Updated 10 months ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆73Updated 4 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆14Updated 5 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago