Alternatives and similar repositories for cuteDB:

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

• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆385Updated 2 months ago
• eileen-code4fun / LSM-Tree
  A simplified implementation for log structured merge tree.
  ☆61Updated 4 years ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆86Updated 2 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆81Updated last year
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆167Updated last year
• amit-davidson / btree
  B-tree implementation for Go
  ☆236Updated 3 years ago
• theodesp / go-heaps
  Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
  ☆101Updated 2 years ago
• brentp / intintmap
  fast int64-int64 map for go
  ☆95Updated 2 years ago
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆217Updated last year
• petermattis / fastcgo
  ☆182Updated 7 years ago
• BWbwchen / MapReduce
  An easy-to-use Map Reduce Go parallel-computing framework inspired by 2021 6.824 lab1. It supports multiple workers threads on a single m…
  ☆222Updated last year
• aclements / go-misc
  Miscellaneous Go hacks
  ☆233Updated 2 weeks ago
• kelindar / binary
  Generic and fast binary serializer for Go
  ☆218Updated last year
• libopenstorage / gossip
  Go implementation of the Gossip protocol
  ☆137Updated 4 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆265Updated 3 years ago
• tidwall / mmap
  Load file-backed memory
  ☆120Updated 2 years ago
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆292Updated 8 months ago
• tysonmote / gommap
  Git mirror of launchpad.net/gommap with additional patches.
  ☆135Updated 10 months ago
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆156Updated last year
• timtadh / fs2
  B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go
  ☆405Updated 5 years ago
• jeromefroe / golang_benchmarks
  Various golang benchmarks I've written
  ☆111Updated 7 years ago
• MauriceGit / skiplist
  A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
  ☆282Updated 2 years ago
• danchia / ddb
  ☆127Updated 6 years ago
• t3rm1n4l / nitro-lsm
  An log structured merge tree varient of nitro storage engine
  ☆28Updated 8 years ago
• gerlacdt / db-key-value-store
  Simple key-value storage server with http endpoints in golang
  ☆42Updated 3 years ago
• stuartcarnie / go-simd
  Optimized functions for Go using SIMD
  ☆194Updated 4 years ago
• tidwall / evio-lite
  Fast event-loop networking for Go (the lite version)
  ☆71Updated 4 years ago
• PacktPublishing / Distributed-Computing-with-Go
  Distributed Computing with Go, published by Packt
  ☆72Updated 2 years ago
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆401Updated 5 months ago
• akutz / go-interface-values
  When storing a value in a Go interface allocates memory on the heap.
  ☆72Updated 3 years ago