Alternatives and similar repositories for optiql

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

• sfu-dis / FPTree
  An open-source FPTree implementation
  ☆27Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated last year
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 2 years ago
• cosmoss-jigu / pactree
  ☆28Updated 3 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆47Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆59Updated 2 months ago
• sfu-dis / pibench-ep2
  Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)
  ☆21Updated 2 years ago
• iotlpf / ROLEX
  ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
  ☆75Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆37Updated 5 years ago
• WukLab / pDPM
  Passive Disaggregated Persistent Memory at USENIX ATC 2020.
  ☆51Updated 4 years ago
• baotonglu / dex
  DEX: Scalable Range Indexing on Disaggregated Memory
  ☆23Updated 10 months ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆56Updated last month
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆75Updated 3 years ago
• thustorage / nvm-datastructure
  ☆50Updated 4 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 4 years ago
• cosmoss-jigu / prism
  ☆14Updated 2 months 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 5 years ago
• sudarsunkannan / lsm_nvm
  NoveLSM
  ☆40Updated 6 years 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…
  ☆35Updated 2 weeks ago
• tuhhosg / exmap
  ☆47Updated last year
• viktorleis / vmcache
  ☆70Updated 3 months ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆108Updated 8 months ago
• sfu-dis / tesseract
  Tesseract: Efficient Online Schema Evolution for Snapshot Databases (VLDB 2023)
  ☆23Updated 2 years ago
• madsys-dev / ROART
  Range Optimized Adaptive Radix Tree
  ☆23Updated 2 years ago
• cosmoss-jigu / tips
  ☆15Updated 3 years ago
• thustorage / perseid
  Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory
  ☆18Updated last year
• liumx10 / ICPP-RNTree
  ☆18Updated 5 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• DICL / CCEH
  ☆98Updated 4 years ago