Alternatives and similar repositories for LSM-Tree

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

• Jille / raft-grpc-example
  Example code for how to get hashicorp/raft running with gRPC
  ☆230Updated last year
• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆150Updated 3 years ago
• arriqaaq / flashdb
  FlashDB is an embeddable, in-memory key/value database in Go (with Redis like commands and super easy to read)
  ☆377Updated 2 years ago
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆277Updated 10 months ago
• alexander-akhmetov / mdb
  LSM tree based key-value database
  ☆31Updated last year
• collinglass / bptree
  B+ tree in pure Go.
  ☆94Updated 10 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…
  ☆226Updated 2 years ago
• merrymercy / goGFS
  A simple implementation of the Google File System in golang
  ☆161Updated 8 years ago
• bnclabs / gostore
  Storage algorithms.
  ☆38Updated 4 years ago
• krasun / lsmtree
  Log-structured merge-tree
  ☆32Updated 2 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.
  ☆263Updated 2 years ago
• tidwall / wal
  Write ahead log for Go.
  ☆689Updated 3 months ago
• YuriyNasretdinov / distribkv
  Distributed key-value database in Go
  ☆44Updated 5 years ago
• isgasho / bitcask
  A Bitcask (LSM+WAL) Key/Value Store written in Go.
  ☆37Updated 6 years ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆192Updated last year
• hashicorp / raft-wal
  experimental raft storage
  ☆107Updated 2 weeks ago
• danchia / ddb
  ☆132Updated 7 years ago
• vadiminshakov / committer
  Two-phase (2PC) and three-phase (3PC) protocols implementaion in Golang
  ☆40Updated last month
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆427Updated last year
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆406Updated last week
• 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.
  ☆223Updated last year
• libopenstorage / gossip
  Go implementation of the Gossip protocol
  ☆143Updated last year
• varunu28 / graft
  🪵 From scratch implementation of Raft consensus algorithm in Go
  ☆40Updated 3 years ago
• SarthakMakhija / go-lsm
  LSM-based key-value store in Go for educational purpose.
  ☆79Updated 8 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆270Updated 4 years ago
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆43Updated 5 years ago
• vision9527 / btree
  Go implementation of B plus tree
  ☆33Updated 3 years ago
• kumaab / MapReduce
  Implementation of MapReduce in Go.
  ☆26Updated 5 years ago
• amit-davidson / btree
  B-tree implementation for Go
  ☆239Updated 3 years ago
• dgryski / go-tinylfu
  TinyLFU cache admission policy
  ☆268Updated 10 months ago