Alternatives and similar repositories for ARC_Cache:

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

• ysj1173886760 / TinyDB
  TinyDB (under progress)
  ☆64Updated 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
• billsjchw / LSMTree
  Homework of SJTU SE121: An LSM Tree KVStore System
  ☆34Updated 4 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 5 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆74Updated 3 years ago
• 374576114 / cache
  LRU LFU ARC MQ LIRS implements
  ☆17Updated 5 years ago
• ustcadsl / depart
  ☆18Updated last year
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆75Updated 4 years ago
• coyorkdow / wisckey
  WiscKey is a highly SSD optimized key-value storage based on LevelDB.
  ☆31Updated 3 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆37Updated 5 years ago
• ustcadsl / unikv
  ☆24Updated 2 years ago
• adslabcuhk / elect
  ☆12Updated last month
• zz-jason / leanstore
  LeanStore is a larger-than-memory database, optimized for NVMe SSD and multi-core CPU, achieves performance close to in-memory systems wi…
  ☆35Updated 6 months ago
• zzy590 / zpaxos
  C++ header only multi-paxos library.
  ☆40Updated 3 years ago
• yhzhou-pds / ATC23-Calcspar
  ☆13Updated last year
• ruihong123 / dLSM
  dLSM: An LSM-Based Index for RDMA-Enabled Memory Disaggregation
  ☆32Updated last year
• anuj-rai-23 / Adaptive-Replacement-Cache-ARC-Algorithm
  A project for Advanced Operating System(CS604) that implements ARC cache replacement policy.
  ☆15Updated 4 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…
  ☆33Updated 2 months ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 3 years ago
• Focus5679 / HotRing-simple-and-simple-demo
  HotRing: A Hotspot-Aware In-Memory Key-Value Store reading report code/data
  ☆41Updated 4 years ago
• a993096281 / YCSB-HWDB
  YCSB-C for HWDB!
  ☆18Updated 4 years ago
• httaotao / paper-for-file-system-study
  收集文件系统相关论文
  ☆41Updated 2 years ago
• BU-DiSC / LSM-Compaction-Analysis
  ☆22Updated 3 years ago
• gatsbyd / cmu_15445_2018
  cmu 15445 2018，DBMS实现
  ☆50Updated 5 years ago
• Connor1996 / badger
  Fast key-value DB in Go.
  ☆16Updated 3 years ago
• jecyhw / tair-contest2
  第二届数据库大赛—Tair性能挑战复赛代码
  ☆19Updated 4 years ago
• cosmoss-jigu / pactree
  ☆28Updated 3 years ago
• ls4154 / YCSB-cpp
  YCSB written in C++ for embedded databases. (supporting LevelDB, RocksDB, LMDB, WiredTiger, and SQLite)
  ☆107Updated last month