Alexandria (named after the Library of Alexandria) is a in-memory, distributed key-value store written in Go. It is NoSQL, eventually consistent, and highly available.
-
Updated
Jan 24, 2018 - Go
Alexandria (named after the Library of Alexandria) is a in-memory, distributed key-value store written in Go. It is NoSQL, eventually consistent, and highly available.
Rafty - Simulation of Raft processes
a fault-tolerant key/value storage system on top of Raft consensus algorithm
Simple (incomplete) implementation of Raft consensus
A key-value storage system that can continue to operate in the face of failures, such as server crashes. This is achieved by using the Raft protocol.
A simple implementation of raft to see how raft works
Projects of MIT 6.824 Distributed Systems 17spring
A scalabale and fault-tolerated cloud-based file storage service system based on RAFT
This project is to develop a distributed file system that conducts basic file handling operations such as file write, read, delete, and update.
Go implemented, fault tolerant distributed system based on RAFT consesus algorithm.
Implementation of Raft consensus algorithm in GO
Implementation of Raft: A distributed consensus protocol, in Go.
distributed leveldb with raft
This repo records the shared key-value storge based on raft.
a note for MIT distributed system course https://pdos.csail.mit.edu/6.824/schedule.html
Key Value Store Implementation Using Raft Consensus Algorithm
A simple Example of a distributed data store written in go using hashicorp's raft implementation
Add a description, image, and links to the raft-consensus-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the raft-consensus-algorithm topic, visit your repo's landing page and select "manage topics."