Alternatives and similar repositories for go-tinylfu

Users that are interested in go-tinylfu are comparing it to the libraries listed below

• MauriceGit / skiplist
  A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
  ☆287Updated 2 years ago
• couchbase / go-slab
  slab allocator in go
  ☆381Updated 7 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆267Updated 3 years ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆395Updated 7 months ago
• glycerine / offheap
  an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.
  ☆375Updated 2 months ago
• ncw / directio
  This is library for the Go language to enable use of Direct IO under all OSes
  ☆328Updated last year
• dshulyak / uring
  Golang library for io_uring (without CGO)
  ☆133Updated 4 years ago
• edwingeng / doublejump
  A revamped Google's jump consistent hash
  ☆107Updated 2 years ago
• jonhoo / drwmutex
  Distributed RWMutex in Go
  ☆358Updated 6 years ago
• timtadh / fs2
  B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go
  ☆409Updated 6 years ago
• hodgesds / iouring-go
  io_uring support for go
  ☆203Updated 4 years ago
• lithammer / go-jump-consistent-hash
  Fast, minimal memory, consistent hash algorithm
  ☆229Updated last year
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆161Updated 2 years ago
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆418Updated 10 months ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆187Updated 11 months ago
• influxdata / tdigest
  An implementation of Ted Dunning's t-digest in Go.
  ☆144Updated 2 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆87Updated 2 years ago
• AndreasBriese / bbloom
  go/golang: fast bit set Bloom filter
  ☆136Updated 5 years ago
• dgryski / go-farm
  go-farm: a pure-Go farmhash implementation
  ☆251Updated 10 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.
  ☆213Updated 11 months ago
• valyala / fastrand
  Fast and scalable pseudorandom generator for Go
  ☆206Updated 3 years ago
• 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.
  ☆260Updated 2 years ago
• tidwall / shardmap
  A simple and efficient thread-safe sharded hashmap for Go
  ☆235Updated 5 years ago
• caio / go-tdigest
  mirror of https://caio.co/de/go-tdigest/
  ☆114Updated 2 months ago
• xeoncross / go-cache-benchmark
  Benchmark all the top in-memory Go caching libraries
  ☆62Updated last year
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆171Updated 2 years ago
• dgryski / go-jump
  go-jump: Jump consistent hashing
  ☆387Updated 3 years ago
• etcd-io / gofail
  failpoints for go
  ☆407Updated 3 weeks ago
• dgrijalva / lfu-go
  A least frequently used cache for Golang
  ☆152Updated 5 years ago
• platinummonkey / go-concurrency-limits
  Go implementation of Netflix/concurrency-limits
  ☆130Updated 2 weeks ago