Alternatives and similar repositories for SNARF

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

• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆14Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• ls4154 / YCSB-cpp
  YCSB written in C++ for embedded databases. (supporting LevelDB, RocksDB, LMDB, WiredTiger, and SQLite)
  ☆116Updated 3 weeks ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆77Updated 3 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆296Updated 3 years ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆54Updated 3 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆94Updated 2 years ago
• yhzhou-pds / ATC23-Calcspar
  ☆15Updated last year
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆62Updated 3 years ago
• cds-ruc / CruiseDB
  An SLA-Oriented LSM-Tree Key-Value Store for High-end Cloud Data Service
  ☆17Updated 4 years ago
• yxymit / DBx1000
  ☆290Updated 2 years ago
• edydfang / Bourbon
  A Learned Index for Log-Structured Merge Trees
  ☆47Updated 2 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• chenyoumin1993 / Plor
  Improving the tail latency of in-memory transactional system.
  ☆10Updated 3 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆167Updated 4 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆48Updated 4 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 6 years ago
• HNUSystemsLab / Halo
  ☆18Updated 3 months ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 8 months ago
• BU-DiSC / LSM-Compaction-Analysis
  ☆25Updated 4 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated 3 weeks ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆119Updated 4 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• sfu-dis / optiql
  Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)
  ☆24Updated last year
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆93Updated last year
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆55Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• rmitbggroup / LearnedIndexDiskExp
  ☆14Updated 2 years ago