Go HOT trie library: fast, SIMD-accelerated ordered key-value store
This library implements the Height Optimized Trie (HOT) data structure for Go, offering read‑optimized key‑value storage with SIMD‑accelerated searches. It provides a drop‑in compatible interface with go‑adaptive‑radix‑tree, enabling easy swapping of implementations. The trie guarantees minimal height regardless of insertion order and supports ordered, reverse, and prefix iterations. It is ideal for developers needing high‑performance in‑memory indexing of byte‑array keys.
View on GitHub →plar/go-hot-trie