Alternatives and similar repositories for QuantaDB

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

• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 4 months ago
• DBOS-project / dbos-scheduler
  ☆28Updated 4 years ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆24Updated 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
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• hydro-project / anna-cache
  A local cache for the Anna KVS
  ☆25Updated 5 years ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆101Updated 2 years ago
• yuhong-zhong / bpf-storage-hotos
  ☆20Updated 4 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 2 years ago
• stonysystems / depfast-ae
  ☆19Updated 6 months ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 2 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆66Updated 3 years ago
• Thesys-lab / Segcache
  ☆121Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 4 years ago
• xrp-project / BPF-KV
  ☆26Updated 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)
  ☆63Updated 3 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• danyangz / lightning
  Lightning In-Memory Object Store
  ☆47Updated 3 years ago
• chestnutme / kv-store-survey
  survey and analysis of kv-stores in academia and industry
  ☆10Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 years ago
• ustcadsl / unikv
  ☆24Updated 3 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆106Updated 11 months ago
• 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
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last week