L-v-M / async

Related projects ⓘ

Alternatives and complementary repositories for async

• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆44Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• tuhhosg / exmap
  ☆37Updated 6 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆51Updated 5 months ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆37Updated 3 weeks ago
• tum-db / cachecoherence
  ☆10Updated 3 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
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years 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
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated last month
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆56Updated 7 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
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆40Updated this week
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆55Updated 6 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• DBOS-project / dbos-scheduler
  ☆26Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆98Updated 8 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆41Updated last year
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆22Updated 9 months ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆148Updated 3 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆14Updated 5 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 4 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆42Updated 5 months ago
• sunbains / embedded-innodb
  Embedded InnoDB based on v5.1
  ☆28Updated last week
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆28Updated 6 years ago