Alternatives and similar repositories for LSM-Tree

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

• 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
• collinglass / bptree
  B+ tree in pure Go.
  ☆94Updated 10 years ago
• alexander-akhmetov / mdb
  LSM tree based key-value database
  ☆30Updated last year
• Jille / raft-grpc-example
  Example code for how to get hashicorp/raft running with gRPC
  ☆223Updated 11 months ago
• merrymercy / goGFS
  A simple implementation of the Google File System in golang
  ☆160Updated 7 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆87Updated 2 years ago
• yongman / leto
  A key value storage example powered by hashicorp raft and BadgerDB
  ☆104Updated 6 years ago
• krasun / lsmtree
  Log-structured merge-tree
  ☆31Updated 2 years ago
• brunocalza / buffer-pool-manager
  ☆34Updated 4 years ago
• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆148Updated 3 years ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆185Updated 10 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆267Updated 3 years ago
• bnclabs / gostore
  Storage algorithms.
  ☆38Updated 4 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 3 years ago
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆263Updated 5 months ago
• arriqaaq / flashdb
  FlashDB is an embeddable, in-memory key/value database in Go (with Redis like commands and super easy to read)
  ☆370Updated last year
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆416Updated 9 months 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.
  ☆210Updated 9 months ago
• chainhelen / bptree
  Implementing bplustree base on disk(kv store).
  ☆34Updated 5 years ago
• libopenstorage / gossip
  Go implementation of the Gossip protocol
  ☆139Updated 8 months ago
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆41Updated 5 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆81Updated last year
• dashjay / mini-lsm-go
  translate skyzh/mini-lsm to go version
  ☆9Updated 2 years ago
• vadiminshakov / committer
  Two-phase (2PC) and three-phase (3PC) protocols implementaion in Golang
  ☆38Updated this week
• 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.
  ☆258Updated 2 years ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆391Updated 6 months ago
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆170Updated 2 years ago
• YuriyNasretdinov / distribkv
  Distributed key-value database in Go
  ☆43Updated 4 years ago
• tidwall / kvbench
  Server for benchmarking pure Go key/value databases
  ☆33Updated 8 years ago