Alternatives and similar repositories for optiql

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

• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆59Updated 3 months ago
• cosmoss-jigu / pactree
  ☆29Updated 3 years ago
• sfu-dis / FPTree
  An open-source FPTree implementation
  ☆27Updated 3 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆76Updated 3 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆48Updated 2 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆37Updated 5 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 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
• baotonglu / dex
  DEX: Scalable Range Indexing on Disaggregated Memory
  ☆23Updated last year
• DICL / CCEH
  ☆98Updated 4 years ago
• sfu-dis / pibench-ep2
  Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)
  ☆21Updated 2 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆49Updated 4 years ago
• ls4154 / YCSB-cpp
  YCSB written in C++ for embedded databases. (supporting LevelDB, RocksDB, LMDB, WiredTiger, and SQLite)
  ☆111Updated 2 weeks ago
• iotlpf / ROLEX
  ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
  ☆78Updated 2 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆164Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 9 months ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆36Updated last month
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• BenTsai7 / SCM-DRAM-FPTree
  2019 Database System Project at Sun Yat-sen University , a simple implementation of SIGMOD, 2016 “FPTree: A Hybrid SCM-DRAM Persistent an…
  ☆24Updated 6 years ago
• cosmoss-jigu / hydralist
  ☆29Updated 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
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆118Updated 4 years ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆110Updated 9 months ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆93Updated 8 months ago
• madsys-dev / ROART
  Range Optimized Adaptive Radix Tree
  ☆23Updated 2 years ago
• ustcadsl / diffkv
  ☆60Updated 2 years ago