YuriyNasretdinov / distribkv

Related projects: ⓘ

• YuriyNasretdinov / chukcha
  Easy to use distributed event bus similar to Kafka
  ☆93Updated 2 years ago
• amit-davidson / btree
  B-tree implementation for Go
  ☆232Updated 2 years ago
• krasun / lsmtree
  Log-structured merge-tree
  ☆25Updated last year
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆233Updated 2 months ago
• eileen-code4fun / LSM-Tree
  A simplified implementation for log structured merge tree.
  ☆57Updated 3 years ago
• zhangyunhao116 / skipset
  skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.
  ☆240Updated last year
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆85Updated 2 years ago
• BWbwchen / MapReduce
  An easy-to-use Map Reduce Go parallel-computing framework inspired by 2021 6.824 lab1. It supports multiple workers threads on a single m…
  ☆219Updated 10 months ago
• vadiminshakov / committer
  Two-phase (2PC) and three-phase (3PC) protocols implementaion in Golang
  ☆29Updated this week
• isgasho / bitcask
  A Bitcask (LSM+WAL) Key/Value Store written in Go.
  ☆37Updated 5 years ago
• PacktPublishing / Distributed-Computing-with-Go
  Distributed Computing with Go, published by Packt
  ☆71Updated last year
• Jille / raft-grpc-example
  Example code for how to get hashicorp/raft running with gRPC
  ☆206Updated last month
• arindas / mit-6.824-distributed-systems
  Template repository to work on the labs from MIT 6.824 Distributed Systems course.
  ☆56Updated 2 years ago
• zhangyunhao116 / skipmap
  skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.
  ☆173Updated 3 weeks ago
• youngzhu / algs4-go
  Algorithms, 4th Edition, Go version
  ☆182Updated last month
• golang-design / lockfree
  ⚡️ lock-free utilities in Go
  ☆146Updated 4 months ago
• tidwall / wal
  Write ahead log for Go.
  ☆586Updated last month
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆358Updated 2 years ago
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆212Updated last year
• libopenstorage / gossip
  Go implementation of the Gossip protocol
  ☆129Updated 6 months ago
• edwingeng / deque
  A highly optimized double-ended queue
  ☆179Updated last year
• arriqaaq / flashdb
  FlashDB is an embeddable, in-memory key/value database in Go (with Redis like commands and super easy to read)
  ☆351Updated 10 months ago
• krasun / gosqldb
  A key-value persistent database that supports SQL queries over B+ and LSM trees
  ☆27Updated 2 years ago
• collinglass / bptree
  B+ tree in pure Go.
  ☆86Updated 9 years ago
• yongman / leto
  A key value storage example powered by hashicorp raft and BadgerDB
  ☆104Updated 6 years ago
• brunocalza / buffer-pool-manager
  ☆30Updated 3 years ago
• yusufsyaifudin / raft-sample
  Straightforward implementation of Raft Consensus
  ☆61Updated 3 years ago
• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆139Updated 2 years ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆179Updated last month
• golang-design / go2generics
  🧪 A chunk of experiments and demos about Go 2 generics design (type parameter & type set)
  ☆150Updated 2 years ago