Alternatives and similar repositories for wal:

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

• tidwall / uhaha
  High Availability Raft Framework for Go
  ☆616Updated last month
• dolthub / swiss
  Golang port of Abseil's SwissTable
  ☆818Updated 7 months ago
• nsqio / go-diskqueue
  A Go package providing a filesystem-backed FIFO queue
  ☆477Updated last year
• akrylysov / pogreb
  Embedded key-value store for read-heavy workloads written in Go
  ☆1,317Updated last month
• buraksezer / consistent
  Consistent hashing with bounded loads in Golang
  ☆718Updated last year
• goccy / go-reflect
  Zero-allocation reflection library for Go
  ☆555Updated last year
• hashicorp / raft-boltdb
  Raft backend implementation using BoltDB
  ☆671Updated this week
• Iceber / iouring-go
  Provides easy-to-use async IO interface with io_uring
  ☆609Updated last year
• MauriceGit / skiplist
  A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
  ☆282Updated 2 years ago
• dghubble / trie
  Fast, zero heap allocation Go Trie for runes or paths
  ☆484Updated 5 months ago
• smallnest / ringbuffer
  a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface
  ☆536Updated 2 months ago
• kelindar / bitmap
  Simple dense bitmap index in Go with binary operators
  ☆321Updated last year
• armon / go-radix
  Golang implementation of Radix trees
  ☆901Updated 7 months ago
• modern-go / reflect2
  reflect api without runtime reflect.Value cost
  ☆777Updated 7 months ago
• alphadose / haxmap
  Fastest and most memory efficient golang concurrent hashmap
  ☆975Updated 3 months ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆383Updated 2 months ago
• hashicorp / go-immutable-radix
  An immutable radix tree implementation in Golang
  ☆1,026Updated this week
• linxGnu / grocksdb
  RocksDB wrapper for Go. Support 9.x, 8.x, 7.x, 6.x, etc
  ☆330Updated last month
• zeebo / xxh3
  XXH3 algorithm in Go
  ☆427Updated 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.
  ☆252Updated last year
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆217Updated last year
• Jille / raft-grpc-example
  Example code for how to get hashicorp/raft running with gRPC
  ☆217Updated 6 months ago
• tidwall / btree
  B-tree implementation for Go
  ☆1,082Updated 8 months ago
• rosedblabs / wal
  Write Ahead Log for LSM or bitcask storage(or any append-only write).
  ☆254Updated 3 weeks ago
• puzpuzpuz / xsync
  Concurrent data structures for Go
  ☆1,178Updated this week
• enriquebris / goconcurrentqueue
  Go concurrent-safe, goroutine-safe, thread-safe queue
  ☆414Updated last year
• joncrlsn / dque
  dque is a fast, embedded, durable queue for Go
  ☆779Updated 3 months 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.
  ☆202Updated 5 months ago
• cornelk / hashmap
  A Golang lock-free thread-safe HashMap optimized for fastest read access.
  ☆1,820Updated last year
• bits-and-blooms / bitset
  Go package implementing bitsets
  ☆1,382Updated 2 weeks ago