tidwall / wal
Write ahead log for Go.
☆611Updated this week
Related projects ⓘ
Alternatives and complementary repositories for wal
- High Availability Raft Framework for Go☆605Updated 10 months ago
- Simple dense bitmap index in Go with binary operators☆311Updated last year
- Golang port of Abseil's SwissTable☆777Updated 4 months ago
- a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface☆510Updated this week
- Consistent hashing with bounded loads in Golang☆698Updated last year
- A Go package providing a filesystem-backed FIFO queue☆470Updated last year
- Fastest and most memory efficient golang concurrent hashmap☆932Updated 3 weeks ago
- Anti-memory-waste byte buffer pool☆1,192Updated 4 months ago
- XXH3 algorithm in Go☆409Updated last year
- Simple key-value store abstraction and implementations for Go (Redis, Consul, etcd, bbolt, BadgerDB, LevelDB, Memcached, DynamoDB, S3, Po…☆747Updated 5 months ago
- Fast, zero heap allocation Go Trie for runes or paths☆471Updated 2 months ago
- Raft backend implementation using BoltDB☆663Updated this week
- reflect api without runtime reflect.Value cost☆766Updated 4 months ago
- Go port of Google's Swiss Table hash table☆321Updated 4 months ago
- Zero-allocation reflection library for Go☆526Updated last year
- Example code for how to get hashicorp/raft running with gRPC☆208Updated 3 months ago
- An immutable radix tree implementation in Golang☆1,002Updated this week
- Embedded key-value store for read-heavy workloads written in Go☆1,311Updated 3 months ago
- Fast ring-buffer deque (double-ended queue)☆590Updated this week
- A thread-safe queue faster and more resource efficient than golang's native channels☆661Updated 8 months ago
- Golang implementation of Radix trees☆888Updated 4 months ago
- Adaptive Radix Trees implemented in Go☆370Updated this week
- A Golang lock-free thread-safe HashMap optimized for fastest read access.☆1,786Updated last year
- Wrapper types for sync/atomic which enforce atomic access☆1,356Updated this week
- dque is a fast, embedded, durable queue for Go☆767Updated 3 weeks ago
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆243Updated last year
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆214Updated last year
- Provides easy-to-use async IO interface with io_uring☆598Updated last year
- A portable mmap package for Go☆948Updated last month