Alternatives and similar repositories for OpenAurora

Users that are interested in OpenAurora 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)
  ☆66Updated last month
• durner / AnyBlob
  AnyBlob - A Universal Cloud Object Storage Download Manager Built For Cost-Throughput Optimal Analytics!
  ☆139Updated 3 weeks ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆53Updated last year
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆146Updated last year
• cloud-olap / FlexPushdownDB
  ☆73Updated 6 months ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆60Updated 6 months ago
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆124Updated last year
• CloudOLTP / Cornus
  ☆22Updated 3 years ago
• zz-jason / leanstore
  LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.
  ☆42Updated last month
• TsinghuaDatabaseGroup / CloudDB
  continuously update cloud database papers
  ☆81Updated last year
• viktorleis / vmcache
  ☆73Updated last month
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• UWHustle / HATtrick
  ☆34Updated 3 years ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆108Updated last month
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆92Updated 2 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆115Updated 4 years ago
• XiangpengHao / bf-tree-docs
  Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index
  ☆59Updated last year
• wangziqi2016 / index-microbench
  ☆149Updated 2 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 3 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆203Updated 2 years ago
• Thesys-lab / sosp23-s3fifo
  The repo for SOSP23 paper: FIFO queues are all you need for cache evictions
  ☆128Updated last year
• BLepers / KVell
  KVell: the Design and Implementation of a Fast Persistent Key-Value Store
  ☆289Updated 4 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 5 years ago
• viktorleis / mmapbench
  ☆141Updated 3 years ago
• flode / ARTSynchronized
  ☆122Updated 3 years ago
• umbra-db / colibri-vldb2024
  Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"
  ☆25Updated last year
• yxymit / DBx1000
  ☆291Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago