Alternatives and similar repositories for cuteDB:

Users that are interested in cuteDB are comparing it to the libraries listed below

• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆86Updated 2 years ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆388Updated 4 months ago
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆409Updated 7 months ago
• amit-davidson / btree
  B-tree implementation for Go
  ☆237Updated 3 years ago
• timtadh / fs2
  B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go
  ☆409Updated 6 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆81Updated last year
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆157Updated last year
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆292Updated 9 months ago
• theodesp / go-heaps
  Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
  ☆101Updated 2 years ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆266Updated 3 years ago
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆217Updated 2 years ago
• libopenstorage / gossip
  Go implementation of the Gossip protocol
  ☆138Updated 6 months ago
• kelindar / binary
  Generic and fast binary serializer for Go
  ☆219Updated last year
• stuartcarnie / go-simd
  Optimized functions for Go using SIMD
  ☆194Updated 4 years ago
• chrislusf / vasto
  A distributed key-value store. On Disk. Able to grow or shrink without service interruption.
  ☆263Updated 6 years ago
• eileen-code4fun / LSM-Tree
  A simplified implementation for log structured merge tree.
  ☆61Updated 4 years ago
• MauriceGit / skiplist
  A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
  ☆285Updated 2 years ago
• kelindar / bitmap
  Simple dense bitmap index in Go with binary operators
  ☆329Updated last year
• krasun / lsmtree
  Log-structured merge-tree
  ☆30Updated 2 years ago
• smasher164 / mem
  A memory allocator for Go.
  ☆82Updated 5 years ago
• arriqaaq / flashdb
  FlashDB is an embeddable, in-memory key/value database in Go (with Redis like commands and super easy to read)
  ☆368Updated last year
• glycerine / offheap
  an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.
  ☆373Updated last year
• panmari / cuckoofilter
  Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.
  ☆46Updated 2 months ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆185Updated 8 months ago
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆169Updated last year
• grab / talaria
  TalariaDB is a distributed, highly available, and low latency time-series database for Presto
  ☆119Updated last year
• wangjia184 / sortedset
  An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing
  ☆157Updated 2 years ago
• tidwall / uhaha
  High Availability Raft Framework for Go
  ☆629Updated last week
• yongman / leto
  A key value storage example powered by hashicorp raft and BadgerDB
  ☆103Updated 6 years ago
• bnclabs / gostore
  Storage algorithms.
  ☆38Updated 4 years ago