Alternatives and similar repositories for GFS

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

• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 8 years ago
• Nov11 / 15-445
  CMU 15-445 2017 (force pushed to erase my works)
  ☆59Updated 5 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 6 years ago
• yifeih / redbase
  Spring 2014. Stanford CS346 project. A mini relational database with query optimization
  ☆167Updated 11 years ago
• merrymercy / goGFS
  A simple implementation of the Google File System in golang
  ☆160Updated 8 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆116Updated 4 years ago
• junjieliu2910 / cmu-15-445
  The project folder of the 15-445 Introduction to Database system
  ☆45Updated 7 years ago
• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 8 years ago
• xingdl2007 / 6.828-2017
  JOS: Operating Systems Engineering. 6.828 teaches the fundamentals of engineering operating systems with a learning by doing method.
  ☆28Updated 7 years ago
• learn-sys / cn
  A website providing info for self-learners who want to explore the world of operating systems. The website template is from https://githu…
  ☆51Updated 4 years ago
• CMU-440-F16 / p3
  Implement the Paxos Algorithm
  ☆18Updated 9 years ago
• junkumar / redbase
  A mini database implementation.
  ☆241Updated 3 months ago
• Pfzuo / Level-Hashing
  Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)
  ☆203Updated 5 years ago
• CalvinNeo / Nuft
  Nuft is an C++17 implementation of the Raft consensus algorithm.
  ☆26Updated 3 years ago
• cocagne / multi-paxos-example
  Example multi-paxos application for those learning Paxos & multi-paxos
  ☆94Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 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
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• miskcoo / TrivialDB
  A simple database engine with common SQL queries support. Final project for course 'Introduction to Databases' of Tsinghua University, Fa…
  ☆153Updated 6 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• MIT-DB-Class / course-info-2018
  Course info for 6.814/6.830 Fall 2018
  ☆163Updated 4 years ago
• cmu-db / peloton-design
  Peloton Design Docs
  ☆28Updated 7 years ago
• shanzi / NvmEngine
  Experimental KV store engine on non-volatile memory
  ☆72Updated 5 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• sphurti / Log-Structured-Filesystem
  LFS using Fuse
  ☆46Updated 13 years ago
• JimChengLin / levi-db
  levi-db is a fast database engine
  ☆36Updated 7 years ago
• adityabhandari1992 / cs346-redbase
  CS 346 RedBase Project (Stanford)
  ☆37Updated 10 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• ustcadsl / unikv
  ☆27Updated 3 years ago