Alternatives and similar repositories for lsmtree

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

• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆61Updated last year
• isgasho / bitcask
  A Bitcask (LSM+WAL) Key/Value Store written in Go.
  ☆38Updated 6 years ago
• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆150Updated 3 years ago
• 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
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆42Updated 5 years ago
• tidwall / bfile
  A buffer pool file I/O library for Go
  ☆55Updated 3 years ago
• krasun / fbptree
  A persistent storage (in file) based using B+ tree with byte-slice keys and values
  ☆28Updated 3 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.
  ☆25Updated 7 months ago
• brunocalza / buffer-pool-manager
  ☆34Updated 4 years ago
• bnclabs / gostore
  Storage algorithms.
  ☆38Updated 4 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆87Updated 3 years ago
• d4l3k / skeletondb
  SkeletonDB is a lock-less thread safe in memory MVCC store written in Go.
  ☆23Updated 8 years ago
• rosedblabs / diskhash
  on-disk hash table(mainly for WAL).
  ☆29Updated 2 years ago
• YuriyNasretdinov / distribkv
  Distributed key-value database in Go
  ☆44Updated 5 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆83Updated last year
• eileen-code4fun / LSM-Tree
  A simplified implementation for log structured merge tree.
  ☆62Updated 4 years ago
• libp2p / go-buffer-pool
  ☆79Updated last month
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆162Updated 2 years ago
• despreston / go-craq
  CRAQ (Chain Replication with Apportioned Queries) in Go
  ☆145Updated 3 years ago
• jonahgao / btree
  B+ tree in memory with mvcc support
  ☆18Updated 6 years ago
• collinglass / bptree
  B+ tree in pure Go.
  ☆94Updated 10 years ago
• tidwall / raft-leveldb
  Raft backend using LevelDB
  ☆32Updated 3 years ago
• grab / async
  ☆30Updated 2 years ago
• krasun / gosqldb
  A key-value persistent database that supports SQL queries over B+ and LSM trees
  ☆31Updated 3 years ago
• geange / lucene-go
  A Go port of Apache Lucene（Go版Lucene）
  ☆62Updated last week
• yusufsyaifudin / raft-sample
  Straightforward implementation of Raft Consensus
  ☆66Updated 4 years ago
• aneshas / gocask
  Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data
  ☆37Updated last year
• 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 last month
• sitano / gsysint
  Golang (as of 1.12.5) runtime internals that gives you an access to internal scheduling primitives. Park Gs, read IDs. (for learning purp…
  ☆69Updated 6 years ago
• tidwall / evio-lite
  Fast event-loop networking for Go (the lite version)
  ☆71Updated 4 years ago