Alternatives and similar repositories for LSM-Tree:

Users that are interested in LSM-Tree are comparing it to the libraries listed below

• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆147Updated 2 years ago
• merrymercy / goGFS
  A simple implementation of the Google File System in golang
  ☆160Updated 7 years ago
• krasun / lsmtree
  Log-structured merge-tree
  ☆30Updated 2 years ago
• yongman / leto
  A key value storage example powered by hashicorp raft and BadgerDB
  ☆103Updated 6 years ago
• vadiminshakov / committer
  Two-phase (2PC) and three-phase (3PC) protocols implementaion in Golang
  ☆35Updated 2 weeks ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆185Updated 8 months ago
• collinglass / bptree
  B+ tree in pure Go.
  ☆93Updated 10 years ago
• vision9527 / btree
  Go implementation of B plus tree
  ☆33Updated 3 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…
  ☆223Updated last year
• bnclabs / gostore
  Storage algorithms.
  ☆38Updated 4 years ago
• alexander-akhmetov / mdb
  LSM tree based key-value database
  ☆29Updated last year
• libopenstorage / gossip
  Go implementation of the Gossip protocol
  ☆138Updated 5 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆266Updated 3 years ago
• Jille / raft-grpc-example
  Example code for how to get hashicorp/raft running with gRPC
  ☆218Updated 9 months ago
• danchia / ddb
  ☆128Updated 6 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆86Updated 2 years ago
• brunocalza / buffer-pool-manager
  ☆34Updated 4 years ago
• amit-davidson / btree
  B-tree implementation for Go
  ☆237Updated 3 years ago
• sean-public / skiplist-survey
  A comparison of skip lists written in Go
  ☆54Updated 3 years ago
• xiang90 / bplustree
  B+ Tree
  ☆91Updated 2 years ago
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆40Updated 4 years ago
• varunu28 / graft
  🪵 From scratch implementation of Raft consensus algorithm in Go
  ☆39Updated 3 years ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆388Updated 4 months ago
• merlin82 / leveldb
  ☆63Updated 3 years ago
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆409Updated 7 months ago
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆258Updated 2 months ago
• dgryski / go-tinylfu
  TinyLFU cache admission policy
  ☆261Updated 3 months ago
• jk316 / paper-on-LSM-Tree
  colletions of papers on LSM-Tree
  ☆23Updated 3 years ago
• nvanbenschoten / epaxos
  A pluggable implementation of the Egalitarian Paxos Consensus Protocol
  ☆61Updated 4 years ago
• isgasho / bitcask
  A Bitcask (LSM+WAL) Key/Value Store written in Go.
  ☆38Updated 6 years ago