Alternatives and similar repositories for SLOG:

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

• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆22Updated 11 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• kunrenyale / CalvinDB
  Geo-replicated CalvinDB(Include the original CalvinDB and low latency version)
  ☆25Updated 5 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 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
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• tuhhosg / exmap
  ☆43Updated 11 months ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆112Updated 3 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 5 months ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆114Updated 2 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)
  ☆78Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆55Updated 5 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…
  ☆121Updated 5 months ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 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
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• viktorleis / vmcache
  ☆63Updated 11 months 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
• umbra-db / colibri-vldb2024
  Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"
  ☆20Updated 8 months ago