Alternatives and similar repositories for go-adaptive-radix-tree

Users that are interested in go-adaptive-radix-tree 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
  ☆290Updated 2 years ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆270Updated 4 years ago
• dgryski / go-tinylfu
  TinyLFU cache admission policy
  ☆267Updated 9 months ago
• tidwall / wal
  Write ahead log for Go.
  ☆687Updated 2 months ago
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆426Updated last year
• glycerine / offheap
  an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.
  ☆380Updated 5 months ago
• ncw / directio
  This is library for the Go language to enable use of Direct IO under all OSes
  ☆335Updated 2 years ago
• timtadh / fs2
  B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go
  ☆408Updated 6 years ago
• kelindar / bitmap
  Simple dense bitmap index in Go with binary operators
  ☆364Updated 4 months 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.
  ☆263Updated 2 years ago
• twmb / murmur3
  Fast, fully fledged murmur3 in Go.
  ☆343Updated 2 years ago
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆162Updated 2 years 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.
  ☆220Updated last year
• nsqio / go-diskqueue
  A Go package providing a filesystem-backed FIFO queue
  ☆495Updated 2 months ago
• stuartcarnie / go-simd
  Optimized functions for Go using SIMD
  ☆191Updated 5 years ago
• armon / go-radix
  Golang implementation of Radix trees
  ☆928Updated last year
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆292Updated last year
• lni / dragonboat-example
  Examples for Dragonboat
  ☆191Updated last year
• dghubble / trie
  Fast, zero heap allocation Go Trie for runes or paths
  ☆496Updated last year
• edsrzf / mmap-go
  A portable mmap package for Go
  ☆1,075Updated 11 months ago
• couchbase / go-slab
  slab allocator in go
  ☆385Updated 10 months ago
• tidwall / uhaha
  High Availability Raft Framework for Go
  ☆650Updated 3 months ago
• smallnest / ringbuffer
  a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface
  ☆602Updated 7 months ago
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆221Updated 2 years ago
• valyala / gozstd
  go wrapper for zstd
  ☆464Updated 2 months ago
• hashicorp / go-immutable-radix
  An immutable radix tree implementation in Golang
  ☆1,070Updated last week
• disksing / iter
  Go implementation of C++ STL iterators and algorithms.
  ☆194Updated 3 years ago
• tidwall / shardmap
  A simple and efficient thread-safe sharded hashmap for Go
  ☆246Updated 6 years ago
• linxGnu / grocksdb
  RocksDB wrapper for Go. Support 10.x, 9.x, 8.x, 7.x, 6.x, etc
  ☆378Updated 2 weeks ago
• couchbase / moss
  moss - a simple, fast, ordered, persistable, key-val storage library for golang
  ☆1,012Updated 10 months ago