eileen-code4fun / LSM-Tree

Related projects ⓘ

Alternatives and complementary repositories for LSM-Tree

• Jille / raft-grpc-example
  Example code for how to get hashicorp/raft running with gRPC
  ☆209Updated 4 months ago
• alexander-akhmetov / mdb
  LSM tree based key-value database
  ☆30Updated 8 months ago
• krasun / lsmtree
  Log-structured merge-tree
  ☆28Updated last year
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆371Updated this week
• despreston / go-craq
  CRAQ (Chain Replication with Apportioned Queries) in Go
  ☆123Updated 2 years ago
• merrymercy / goGFS
  A simple implementation of the Google File System in golang
  ☆159Updated 7 years ago
• bnclabs / gostore
  Storage algorithms.
  ☆36Updated 3 years ago
• collinglass / bptree
  B+ tree in pure Go.
  ☆91Updated 9 years ago
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆240Updated 4 months ago
• sean-public / skiplist-survey
  A comparison of skip lists written in Go
  ☆53Updated 3 years ago
• yongman / leto
  A key value storage example powered by hashicorp raft and BadgerDB
  ☆104Updated 6 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆85Updated 2 years ago
• hashicorp / raft-wal
  experimental raft storage
  ☆86Updated this week
• naqvijafar91 / cuteDB
  A slick BTree on disk based key value store implemented in pure Go
  ☆141Updated 2 years ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆184Updated 3 months ago
• amit-davidson / btree
  B-tree implementation for Go
  ☆233Updated 2 years ago
• brunocalza / buffer-pool-manager
  ☆31Updated 3 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆78Updated 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…
  ☆220Updated last year
• 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.
  ☆244Updated last year
• vision9527 / btree
  Go implementation of B plus tree
  ☆33Updated 2 years ago
• rosedblabs / diskhash
  on-disk hash table(mainly for WAL).
  ☆24Updated last year
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆41Updated 4 years ago
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆382Updated 2 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆265Updated 3 years ago
• jonahgao / btree
  B+ tree in memory with mvcc support
  ☆18Updated 6 years ago
• pingcap / badger
  Fast key-value DB in Go.
  ☆25Updated last month
• varunu28 / graft
  🪵 From scratch implementation of Raft consensus algorithm in Go
  ☆37Updated 2 years ago
• isgasho / bitcask
  A Bitcask (LSM+WAL) Key/Value Store written in Go.
  ☆40Updated 5 years ago
• dgryski / go-tinylfu
  TinyLFU cache admission policy
  ☆252Updated last year