Alternatives and similar repositories for BASIL

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

• DKU-StarLab / ThanosKV
  ThanosKV: A Holistic Approach to Utilize NVM for LSM-tree based Key-Value Stores
  ☆13Updated 9 months ago
• DKU-StarLab / TieredStorageHybridComp
  RocksDB scheme that implements the levels into heterogeneous storage and utilizes hybrid compression techniques.
  ☆16Updated 9 months ago
• DKU-StarLab / SkipList-Research
  ☆14Updated last year
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆53Updated 2 years ago
• sudarsunkannan / lsm_nvm
  NoveLSM
  ☆40Updated 6 years ago
• cds-ruc / SALI
  ☆16Updated last year
• schencoding / lbtree
  LB+-Tree implementation
  ☆49Updated 4 years ago
• tawnysky / PLIN
  A persistent learned index for non-volatile memory with high read/write performance.
  ☆18Updated 3 years ago
• cosmoss-jigu / pactree
  ☆29Updated 3 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆48Updated 2 years ago
• HNUSystemsLab / Halo
  ☆18Updated 2 years ago
• sfu-dis / optiql
  Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)
  ☆24Updated last year
• rmitbggroup / LearnedIndexDiskExp
  ☆14Updated 2 years ago
• unist-ssl / DyTIS
  Open-source repository for the paper "DyTIS: A Dynamic Dataset Targeted Index Structure Simultaneously Efficient for Search, Insert, and …
  ☆14Updated 2 years ago
• chaohcc / film
  a fully learned index for larger-than-memory databases
  ☆14Updated 2 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆33Updated 3 years ago
• CGCL-codes / mioDB
  MioDB: Devouring Data Byte-addressable LSM-based KV Stores for Hybrid Memory
  ☆17Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• DICL / CCEH
  ☆98Updated 4 years ago
• liumx10 / ICPP-RNTree
  ☆18Updated 6 years ago
• thustorage / pacman
  Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory
  ☆44Updated 2 years ago
• edydfang / Bourbon
  A Learned Index for Log-Structured Merge Trees
  ☆45Updated 2 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆110Updated 11 months ago
• thustorage / nvm-datastructure
  ☆50Updated 5 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…
  ☆36Updated 2 months ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆118Updated 4 years ago
• luffy06 / NFL
  [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation
  ☆20Updated last year
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆60Updated 3 years ago
• ls4154 / YCSB-cpp
  YCSB written in C++ for embedded databases. (supporting LevelDB, RocksDB, LMDB, WiredTiger, and SQLite)
  ☆114Updated last month
• asu-idi / prophet-rocksdb
  [MSST '24] Prophet: Optimizing LSM-Based Key-Value Store on ZNS SSDs with File Lifetime Prediction and Compaction Compensation.
  ☆15Updated last year