Alternatives and similar repositories for mosaicdb

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

• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆68Updated 2 months ago
• sfu-dis / optiql
  Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)
  ☆24Updated last year
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• viktorleis / vmcache
  ☆75Updated 2 months ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• Thesys-lab / sosp23-s3fifo
  The repo for SOSP23 paper: FIFO queues are all you need for cache evictions
  ☆131Updated last year
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆77Updated 3 years ago
• flode / ARTSynchronized
  ☆124Updated 3 years ago
• readablesystems / sto
  Software Transactional Objects
  ☆56Updated last year
• SJTU-IPADS / vegito
  ☆53Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• baotonglu / dex
  DEX: Scalable Range Indexing on Disaggregated Memory
  ☆24Updated last year
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 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
• cosmoss-jigu / pactree
  ☆29Updated 4 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆27Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• CloudOLTP / Cornus
  ☆22Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 3 years ago
• alexandervanrenen / pmembench
  Low level algorithms for persistent memory.
  ☆16Updated 4 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• sfu-dis / tesseract
  Tesseract: Efficient Online Schema Evolution for Snapshot Databases (VLDB 2023)
  ☆24Updated 2 years ago
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆37Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆157Updated 7 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 6 years ago
• sfu-dis / FPTree
  An open-source FPTree implementation
  ☆27Updated 3 years ago