This paper proposed a storing approach for trie structures, called Coordinate Hash Trie. For a trie with $n$ nodes and an alphabet with size $m$, the execution time of finding, inserting and deleting a child node, is $O(1)$ for the average case, $O(m)$ for the worst case. The space used by this approach is $O(n)$, unrelated to $m$. The constant of space consumption is predictable, with no need for reallocation or resizing.

翻译：本文提出了一种名为坐标哈希字典树（Coordinate Hash Trie）的字典树结构存储方法。对于具有 $n$ 个节点且字母表大小为 $m$ 的字典树，查找、插入和删除子节点的平均执行时间为 $O(1)$，最坏情况为 $O(m)$。该方法使用的空间为 $O(n)$，与 $m$ 无关。空间消耗的常数是可预测的，无需进行重新分配或大小调整。