plar / go-adaptive-radix-tree
Adaptive Radix Trees implemented in Go
☆380Updated last month
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
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆282Updated last year
- TinyLFU cache admission policy☆257Updated last month
- an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.☆371Updated last year
- A fast, threadsafe skip list in Go☆264Updated 3 years ago
- Fast and easy-to-use skip list for Go.☆397Updated 3 months ago
- Write ahead log for Go.☆627Updated 2 months ago
- Simple dense bitmap index in Go with binary operators☆318Updated last year
- Fast, fully fledged murmur3 in Go.☆312Updated last year
- Serialized Roaring Bitmaps☆275Updated last year
- ⚡️ lock-free utilities in Go☆151Updated 7 months ago
- Raft backend implementation using BoltDB☆664Updated this week
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆250Updated last year
- An immutable radix tree implementation in Golang☆1,020Updated 3 weeks ago
- XXH3 algorithm in Go☆415Updated last year
- A Go library implementing a FST (finite state transducer)☆195Updated 3 weeks ago
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆216Updated last year
- B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go☆404Updated 5 years ago
- Golang implementation of Radix trees☆896Updated 6 months ago
- Server for benchmarking pure Go key/value databases☆155Updated last year
- Fast, zero heap allocation Go Trie for runes or paths☆479Updated 3 months ago
- This is library for the Go language to enable use of Direct IO under all OSes☆318Updated last year
- Go port of Google's Swiss Table hash table☆332Updated 6 months ago
- skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.☆198Updated 4 months ago
- A Go package providing a filesystem-backed FIFO queue☆477Updated last year
- slab allocator in go☆377Updated last month
- Fast and scalable pseudorandom generator for Go☆202Updated 3 years ago
- high performance in-memory cache☆284Updated this week
- A simple and efficient thread-safe sharded hashmap for Go☆225Updated 5 years ago
- A highly optimized double-ended queue☆189Updated last year