arriqaaq / art
An Adaptive Radix Tree (ART) implementation in Go
☆81Updated last year
Alternatives and similar repositories for art:
Users that are interested in art are comparing it to the libraries listed below
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆67Updated 7 months ago
- Embedded durable, extensive, concurrent safe, highly configurable, transactional LSM tree based key-value store package☆35Updated 5 months ago
- ☆118Updated last year
- Off heap golang memory pool☆59Updated 3 years ago
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆54Updated 2 years ago
- Fastest and most efficient goroutine pool (experimental)☆137Updated 2 years ago
- Make hashicorp/raft communicate over gRPC☆50Updated 8 months ago
- A simple In-Memory Data Grid in Go☆72Updated 2 years ago
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 2 years ago
- Expr – a tiny stack-based virtual machine written in Go☆31Updated 3 years ago
- Simple and efficient WAL implementation in Go 🚀☆59Updated 10 months ago
- Go io uring syscall implementation without CGO, rewrite on branch v0.4☆113Updated last year
- Go programming language port of liburing.☆100Updated last year
- The `io_uring` library and runtime for GO☆127Updated 2 years ago
- Golang lock-free Hashmap and List☆71Updated 2 years ago
- Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.☆45Updated 3 weeks ago
- Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data☆35Updated last year
- on-disk hash table(mainly for WAL).☆27Updated last year
- Easy to use Raft library to make your app distributed, highly available and fault-tolerant☆70Updated 3 years ago
- Extremely fast Bloom filters for Go☆46Updated 5 months ago
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆80Updated 3 years ago
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.☆40Updated 4 years ago
- A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.☆28Updated 3 years ago
- simple data streams for go☆31Updated 2 years ago
- Generic, zero-alloc, 100%-test covered Quadtree for golang☆37Updated last year
- Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)☆67Updated 2 years ago
- 🏇🏻 generalist, fast and tiny binary parser and compiler generator, powered by Go 1.18+ Generics☆59Updated 2 years ago
- Load file-backed memory☆120Updated 2 years ago
- Fast event-loop networking for Go (the lite version)☆71Updated 4 years ago
- Golang library for io_uring (without CGO)☆133Updated 4 years ago