Alternatives and similar repositories for LSM-Tree:

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

• collinglass / bptree
  B+ tree in pure Go.
  ☆93Updated 9 years ago
• krasun / lsmtree
  Log-structured merge-tree
  ☆29Updated 2 years ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆184Updated 7 months ago
• yongman / leto
  A key value storage example powered by hashicorp raft and BadgerDB
  ☆103Updated 6 years ago
• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆145Updated 2 years ago
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆255Updated last month
• Jille / raft-grpc-example
  Example code for how to get hashicorp/raft running with gRPC
  ☆216Updated 7 months ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆86Updated 2 years ago
• bnclabs / gostore
  Storage algorithms.
  ☆37Updated 4 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆81Updated last year
• merrymercy / goGFS
  A simple implementation of the Google File System in golang
  ☆160Updated 7 years ago
• alexander-akhmetov / mdb
  LSM tree based key-value database
  ☆29Updated last year
• 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…
  ☆222Updated last year
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆401Updated 5 months ago
• vision9527 / btree
  Go implementation of B plus tree
  ☆33Updated 2 years ago
• hashicorp / raft-wal
  experimental raft storage
  ☆93Updated this week
• despreston / go-craq
  CRAQ (Chain Replication with Apportioned Queries) in Go
  ☆134Updated 2 years ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆385Updated 2 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆265Updated 3 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.
  ☆204Updated 6 months ago
• YuriyNasretdinov / distribkv
  Distributed key-value database in Go
  ☆42Updated 4 years ago
• eatonphil / gomvcc
  A little, pedagogical implementation of mvcc and transaction isolation levels.
  ☆55Updated 4 months ago
• matrixorigin / matrixkv
  This is a distributed kv project to demonstrate how to use matrixcube
  ☆17Updated 2 years ago
• matrixorigin / matrixcube
  Fundamental Building Block for Elastic Storage With Strong Consistency and Reliability
  ☆208Updated 2 years ago
• nvanbenschoten / epaxos
  A pluggable implementation of the Egalitarian Paxos Consensus Protocol
  ☆61Updated 4 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.
  ☆254Updated last year
• brunocalza / buffer-pool-manager
  ☆35Updated 4 years ago
• sean-public / skiplist-survey
  A comparison of skip lists written in Go
  ☆53Updated 3 years ago
• krasun / fbptree
  A persistent storage (in file) based using B+ tree with byte-slice keys and values
  ☆25Updated 3 years ago
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆40Updated 4 years ago