dgryski / go-tinylfuLinks
TinyLFU cache admission policy
☆265Updated 5 months ago
Alternatives and similar repositories for go-tinylfu
Users that are interested in go-tinylfu 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 last month
- A fast, threadsafe skip list in Go☆267Updated 3 years ago
- slab allocator in go☆380Updated 6 months ago
- Adaptive Radix Trees implemented in Go☆392Updated 6 months ago
- io_uring support for go☆203Updated 4 years ago
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆286Updated 2 years ago
- Distributed RWMutex in Go☆358Updated 6 years ago
- This is library for the Go language to enable use of Direct IO under all OSes☆325Updated last year
- A revamped Google's jump consistent hash☆106Updated 2 years ago
- Golang library for io_uring (without CGO)☆133Updated 4 years ago
- B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go☆408Updated 6 years ago
- Server for benchmarking pure Go key/value databases☆161Updated last year
- An implementation of Ted Dunning's t-digest in Go.☆144Updated 2 years ago
- mirror of https://caio.co/de/go-tdigest/☆114Updated last month
- Fast, minimal memory, consistent hash algorithm☆228Updated last year
- go/golang: fast bit set Bloom filter☆136Updated 5 years ago
- go-jump: Jump consistent hashing☆387Updated 3 years ago
- Examples for Dragonboat☆186Updated 11 months ago
- A Go package providing a filesystem-backed FIFO queue☆487Updated last year
- Fast and easy-to-use skip list for Go.☆418Updated 9 months ago
- A RAFT Election implementation in Go.☆188Updated 2 months ago
- Fast and scalable pseudorandom generator for Go☆206Updated 3 years ago
- Raft backend implementation using BoltDB☆684Updated last week
- Effective Computation of Things☆190Updated 2 years ago
- failpoints for go☆407Updated last month
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆260Updated 2 years ago
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 2 years ago
- go-farm: a pure-Go farmhash implementation☆250Updated 9 months ago
- skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.☆212Updated 10 months ago
- A simple and efficient thread-safe sharded hashmap for Go☆228Updated 5 years ago