A memory-efficient Java implementation of a string-keyed trie (radix tree) for fast lookups with minimal memory usage.
A very memory-efficient trie (radix tree) implementation
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.