Home▸Algorithms & AI▸Radix Trie Compression: From Trie to PATRICIA

Radix Trie Compression: From Trie to PATRICIA

Interactive 3D radix-trie simulator: watch a standard character trie collapse into a compressed PATRICIA trie, walk live prefix queries through it, and see the node-count reduction that powers real-world autocomplete indexes.

Algorithms & AI3DAdvanced60 FPS📱 Mobile-adapted⇄ 2D version

This simulator builds a real character trie from a small word set and renders it as a 3D node-and-edge graph, then lets you compress it into a radix trie (PATRICIA trie) with one click — the exact node-merging algorithm real prefix indexes use to trade a node-per-character trie for a far more compact structure. Toggle between the expanded trie and the compressed radix trie to see the node count fall in real time, then type a prefix into the query box to watch it walk the live tree edge by edge, highlighting the matched path and every word it leads to, just as an autocomplete engine resolves a keystroke into suggestions.

⚙ Under the hood

Build a character trie in 3D, compress it live into a radix (PATRICIA) trie by merging single-child chains into labelled edges, and walk prefix queries through either structure to see how autocomplete indexes resolve a keystroke.

trieradix-treepatricia-trieprefix-searchautocompletedata-structures

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install