Alternatives and similar repositories for cs265-lsm-tree

Users that are interested in cs265-lsm-tree are comparing it to the libraries listed below

• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 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
• CDDSCLab / Weekly-Group-Meeting-Paper-List
  DSCL weekly group meeting paper list
  ☆63Updated 2 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated 4 months ago
• UncP / aili
  the fastest in-memory index in the East 东半球最快并发索引
  ☆477Updated 4 years ago
• yxymit / DBx1000
  ☆290Updated 2 years ago
• BU-DiSC / LSM-Compaction-Analysis
  ☆25Updated 4 years ago
• TsinghuaDatabaseGroup / CloudDB
  continuously update cloud database papers
  ☆83Updated last year
• vldbss-2021 / vldb-2021-labs
  Labs on distributed transaction
  ☆241Updated 3 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 4 years ago
• cloud-olap / FlexPushdownDB
  ☆74Updated 8 months ago
• platoneko / tinykv
  Talent Plan 2.0
  ☆53Updated 4 years ago
• RapidsAtHKUST / EngineRaceRapids
  Rapids团队 (https://github.com/CheYulin , https://github.com/shixuansun and https://github.com/WANG-lp), Engine Race (Key-Value Store on I…
  ☆112Updated 6 years ago
• coyorkdow / wisckey
  WiscKey is a highly SSD optimized key-value storage based on LevelDB.
  ☆32Updated 3 years ago
• luyi0619 / aria
  GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database
  ☆74Updated last year
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• JasonYuchen / notes
  reading...
  ☆32Updated 4 months ago
• yifeih / redbase
  Spring 2014. Stanford CS346 project. A mini relational database with query optimization
  ☆167Updated 11 years ago
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 5 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• giorgospan / Radix-Hash-Join
  Radix Hash Join - SIGMOD Contest 2018.
  ☆34Updated 6 years ago
• shanzi / NvmEngine
  Experimental KV store engine on non-volatile memory
  ☆72Updated 5 years ago
• rsy56640 / paper-reading
  record paper reading notes
  ☆42Updated 2 years ago
• zz-jason / leanstore
  LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.
  ☆45Updated this week
• jecyhw / tair-contest2
  第二届数据库大赛—Tair性能挑战复赛代码
  ☆19Updated 5 years ago
• BLepers / KVell
  KVell: the Design and Implementation of a Fast Persistent Key-Value Store
  ☆292Updated last week
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 4 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆90Updated 8 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
• wisehead / myrocks_notes
  myrocks and rocksdb source code analysis（myrocks/rocksdb源码解析）
  ☆82Updated 5 years ago