Alternatives and similar repositories for remixdb

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

• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• ustcadsl / unikv
  ☆24Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆150Updated 7 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 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
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆91Updated 2 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 6 months ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆144Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 7 months ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆199Updated last year
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated 10 months ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 4 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆75Updated 3 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆162Updated 4 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)
  ☆54Updated 3 weeks ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• BU-DiSC / lethe-codebase
  ☆14Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated last year
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• PDS-Lab / GearDB
  GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction
  ☆39Updated 5 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year