Alternatives and similar repositories for mxtasking

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

• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 4 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆138Updated 3 weeks ago
• viktorleis / vmcache
  ☆81Updated 4 months ago
• tuhhosg / exmap
  ☆50Updated last year
• zzy590 / article-code
  知乎文章附带代码
  ☆15Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 9 months ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆78Updated 3 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆70Updated last month
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆15Updated 2 years ago
• unodb-dev / unodb
  Adaptive Radix Tree in C++
  ☆50Updated 2 weeks ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆84Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆39Updated 5 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆106Updated 7 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• pmem / rpma
  Remote Persistent Memory Access Library
  ☆105Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 6 years ago
• readablesystems / sto
  Software Transactional Objects
  ☆56Updated last year