Alternatives and similar repositories for lsmtree

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

• krasun / fbptree
  A persistent storage (in file) based using B+ tree with byte-slice keys and values
  ☆27Updated 3 years ago
• krasun / gosqldb
  A key-value persistent database that supports SQL queries over B+ and LSM trees
  ☆29Updated 3 years ago
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆41Updated 5 years ago
• isgasho / bitcask
  A Bitcask (LSM+WAL) Key/Value Store written in Go.
  ☆38Updated 6 years ago
• zhangyunhao116 / umap
  A fast, reliable, simple hashmap that only supports the uint64 key/value. Faster than the runtime hashmap in almost all cases.
  ☆23Updated 3 months ago
• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆61Updated last year
• eileen-code4fun / LSM-Tree
  A simplified implementation for log structured merge tree.
  ☆61Updated 4 years ago
• 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
• libp2p / go-buffer-pool
  ☆80Updated 2 months ago
• JyotinderSingh / go-wal
  A Write-Ahead-Log implementation in Go
  ☆22Updated last year
• rosedblabs / diskhash
  on-disk hash table(mainly for WAL).
  ☆28Updated last year
• YuriyNasretdinov / distribkv
  Distributed key-value database in Go
  ☆43Updated 4 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆87Updated 2 years ago
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆160Updated 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…
  ☆34Updated last year
• gammazero / radixtree
  adaptive radix tree (a.k.a prefix tree or compact trie)
  ☆32Updated 3 months ago
• jonahgao / btree
  B+ tree in memory with mvcc support
  ☆18Updated 6 years ago
• panmari / cuckoofilter
  Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.
  ☆46Updated 4 months ago
• tidwall / raft-leveldb
  Raft backend using LevelDB
  ☆32Updated 3 years ago
• aneshas / gocask
  Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data
  ☆35Updated last year
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆170Updated 2 years ago
• chenzhuoyu / iasm
  Interactive Assembler for Go
  ☆65Updated 7 months ago
• dolthub / maphash
  ☆121Updated last year
• alphadose / itogami
  Fastest and most efficient goroutine pool (experimental)
  ☆141Updated 2 years ago
• golang-design / lockfree
  ⚡️ lock-free utilities in Go
  ☆158Updated last year
• tidwall / kvbench
  Server for benchmarking pure Go key/value databases
  ☆33Updated 8 years ago
• yusufsyaifudin / raft-sample
  Straightforward implementation of Raft Consensus
  ☆65Updated 4 years ago
• Link512 / stealthpool
  Off heap golang memory pool
  ☆60Updated 3 years ago
• bnclabs / gostore
  Storage algorithms.
  ☆38Updated 4 years ago