Alternatives and similar repositories for lsmtree

Users that are interested in lsmtree are comparing it to the libraries listed below

• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆149Updated 3 years ago
• rosedblabs / diskhash
  on-disk hash table(mainly for WAL).
  ☆29Updated last year
• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆61Updated last year
• prologic / bitcask
  🔑 A high performance Key/Value store written in Go with a predictable read/write performance and high throughput. Uses a Bitcask on-disk…
  ☆33Updated last year
• tidwall / bfile
  A buffer pool file I/O library for Go
  ☆55Updated 3 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆81Updated last year
• zhangyunhao116 / umap
  A fast, reliable, simple hashmap that only supports the uint64 key/value. Faster than the runtime hashmap in almost all cases.
  ☆25Updated 5 months ago
• isgasho / bitcask
  A Bitcask (LSM+WAL) Key/Value Store written in Go.
  ☆39Updated 6 years ago
• yusufsyaifudin / raft-sample
  Straightforward implementation of Raft Consensus
  ☆66Updated 4 years ago
• JyotinderSingh / go-wal
  A Write-Ahead-Log implementation in Go
  ☆22Updated last year
• Link512 / stealthpool
  Off heap golang memory pool
  ☆60Updated 4 years ago
• krasun / gosqldb
  A key-value persistent database that supports SQL queries over B+ and LSM trees
  ☆30Updated 3 years ago
• claygod / coffer
  Simply ACID* key-value database. At the medium or even low latency it tries to provide greater throughput without losing the ACID propert…
  ☆40Updated 2 weeks ago
• brunocalza / buffer-pool-manager
  ☆34Updated 4 years ago
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆42Updated 5 years ago
• aneshas / gocask
  Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data
  ☆37Updated last year
• krasun / fbptree
  A persistent storage (in file) based using B+ tree with byte-slice keys and values
  ☆28Updated 3 years ago
• ksrichard / easyraft
  Easy to use Raft library to make your app distributed, highly available and fault-tolerant
  ☆74Updated 3 years ago
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆161Updated 2 years ago
• YuriyNasretdinov / distribkv
  Distributed key-value database in Go
  ☆44Updated 5 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆87Updated 2 years ago
• tidwall / raft-leveldb
  Raft backend using LevelDB
  ☆32Updated 3 years ago
• hashicorp / raft-wal
  experimental raft storage
  ☆103Updated last week
• rqlite / sql
  Pure Go SQL parser
  ☆163Updated 2 months ago
• alphadose / itogami
  Fastest and most efficient goroutine pool (experimental)
  ☆139Updated 2 years ago
• felixge / go-cpu-utilization
  ☆38Updated 2 years ago
• gammazero / radixtree
  adaptive radix tree (a.k.a prefix tree or compact trie)
  ☆33Updated 5 months ago
• aarthikrao / timeMachine
  A distributed fault tolerant scheduler that is horizontally scalable 🔥
  ☆98Updated 10 months ago
• brentp / intintmap
  fast int64-int64 map for go
  ☆98Updated 2 years ago
• jonahgao / btree
  B+ tree in memory with mvcc support
  ☆18Updated 6 years ago