timtadh / fs2Links
B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go
☆409Updated 6 years ago
Alternatives and similar repositories for fs2
Users that are interested in fs2 are comparing it to the libraries listed below
Sorting:
- an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.☆375Updated 2 months ago
- slab allocator in go☆381Updated 7 months ago
- TinyLFU cache admission policy☆266Updated 6 months ago
- A fast, threadsafe skip list in Go☆267Updated 3 years ago
- Fast, minimal memory, consistent hash algorithm☆229Updated last year
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆287Updated 2 years ago
- github.com/cznic/b has moved to modernc.org/b☆221Updated 6 years ago
- A skip list implementation in Go☆238Updated 5 years ago
- A reference implementation for using the go-raft library for distributed consensus.☆297Updated 9 years ago
- Fast and easy-to-use skip list for Go.☆418Updated 10 months ago
- Distributed RWMutex in Go☆358Updated 6 years ago
- Fast golang queue using ring-buffer☆630Updated 2 years ago
- Fast Raft framework using the Redis protocol for Go☆540Updated 4 years ago
- Raft backend implementation using BoltDB☆688Updated 3 weeks ago
- Adaptive Radix Trees implemented in Go☆395Updated 7 months ago
- High-performance framework for building redis-protocol compatible TCP servers/services☆446Updated 2 years ago
- ☆326Updated 6 years ago
- A Go library that implements Consistent Hashing and Consistent Hashing With Bounded Loads.☆683Updated last year
- Distributed, fault-tolerant key-value storage written in go.☆366Updated 6 years ago
- moss - a simple, fast, ordered, persistable, key-val storage library for golang☆1,009Updated 7 months ago
- Golang implementation of Radix trees☆918Updated last year
- Brings SO_REUSEPORT into your Go server☆573Updated 4 years ago
- This is library for the Go language to enable use of Direct IO under all OSes☆328Updated last year
- Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go☆353Updated 6 years ago
- A Left-Leaning Red-Black (LLRB) implementation of balanced binary search trees for Google Go☆812Updated 2 years ago
- go/golang: fast bit set Bloom filter☆136Updated 5 years ago
- levigo is a Go wrapper for LevelDB☆419Updated 3 years ago
- go-jump: Jump consistent hashing☆387Updated 3 years ago
- A few miscellaneous Go microbenchmarks.☆148Updated 9 years ago
- Buffer/Byte pool for Go☆475Updated 6 years ago