Radixtries

Radixtries is a term used in information retrieval and computer science to describe a hybrid data structure that merges features of radix trees (compressed prefix trees) with tries (prefix-based search). In a radixtry, keys are strings and nodes implement compact edges that label paths with substrings, allowing long chains of single-child nodes to be collapsed. At terminal nodes, associated values or pointers are stored.

The structure supports common dictionary operations: insert, search, delete, and prefix queries. Searches progress by traversing edge labels according to the input string, consuming multiple characters per edge. Because path compression reduces the number of nodes, radixtries can offer faster traversal and lower memory usage than classic tries in datasets with long common prefixes.

Variants differ in how they store edge labels, how they handle deletions, and whether they compress until branching nodes or only until the first node with multiple children. Implementations may adapt mapping structures (arrays, hash maps) for child lookup and may store metadata to speed up prefix queries or balancing.

Typical use cases include routing table lookups, auto-completion, spell-checking, and genome sequence querying, where large dictionaries with shared prefixes are common.

Radixtries are not a universally standardized term; they appear in some theoretical discussions and project-specific documentation as a concept blending radix compression with trie search. As with any hybrid structure, real-world performance depends on data characteristics and implementation details.