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
  ☆228Updated last year
• merrymercy / goGFS
  A simple implementation of the Google File System in golang
  ☆161Updated 8 years ago
• alexander-akhmetov / mdb
  LSM tree based key-value database
  ☆31Updated last year
• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆149Updated 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…
  ☆225Updated last year
• SarthakMakhija / go-lsm
  LSM-based key-value store in Go for educational purpose.
  ☆76Updated 6 months ago
• arriqaaq / flashdb
  FlashDB is an embeddable, in-memory key/value database in Go (with Redis like commands and super easy to read)
  ☆373Updated last year
• lni / dragonboat-example
  Examples for Dragonboat
  ☆189Updated last year
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆274Updated 7 months ago
• collinglass / bptree
  B+ tree in pure Go.
  ☆94Updated 10 years ago
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆421Updated 11 months ago
• danchia / ddb
  ☆130Updated 7 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
  ☆399Updated 9 months ago
• dgryski / go-tinylfu
  TinyLFU cache admission policy
  ☆266Updated 7 months 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.
  ☆262Updated 2 years ago
• hashicorp / raft-wal
  experimental raft storage
  ☆103Updated 2 weeks ago
• matrixorigin / matrixcube
  Fundamental Building Block for Elastic Storage With Strong Consistency and Reliability
  ☆209Updated 3 years ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆268Updated 3 years ago
• tidwall / wal
  Write ahead log for Go.
  ☆678Updated 3 weeks 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.
  ☆218Updated last year
• bnclabs / gostore
  Storage algorithms.
  ☆38Updated 4 years ago
• brunocalza / buffer-pool-manager
  ☆34Updated 4 years ago
• amit-davidson / LibraDB
  LibraDB is a simple, persistent key/value store written in pure Go in less than 1000 lines for learning purposes.
  ☆194Updated last year
• krasun / lsmtree
  Log-structured merge-tree
  ☆32Updated 2 years ago
• vision9527 / btree
  Go implementation of B plus tree
  ☆33Updated 3 years ago
• sean-public / skiplist-survey
  A comparison of skip lists written in Go
  ☆54Updated 4 years ago
• despreston / go-craq
  CRAQ (Chain Replication with Apportioned Queries) in Go
  ☆145Updated 3 years ago
• libopenstorage / gossip
  Go implementation of the Gossip protocol
  ☆141Updated 10 months ago
• yongman / leto
  A key value storage example powered by hashicorp raft and BadgerDB
  ☆102Updated 7 years ago