go-adaptive-radix-tree
A high-performance, memory-efficient Go implementation of Adaptive Radix Trees with zero-allocation searches and ordered iteration.
What is go-adaptive-radix-tree?
go-adaptive-radix-tree is a Go implementation of the Adaptive Radix Tree (ART), a data structure designed for efficient in-memory indexing of keys. It provides high-performance search, insertion, and deletion operations while maintaining keys in sorted order, enabling additional operations like range scans and prefix lookups that hash tables cannot support.
Go developers building systems requiring fast in-memory indexing with ordered data access patterns, such as databases, search engines, or applications needing prefix-based autocomplete functionality.
Developers choose this library for its combination of hash-table-like performance with the ordered iteration capabilities of trees, plus its specific optimization of zero memory allocations during searches, which outperforms other Go ART implementations.
Overview
Adaptive Radix Trees implemented in Go
Use Cases
Best For
- Implementing in-memory indexes for databases or search engines
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
