This paper proposed a storing approach for trie structures, called coordinate hash trie. The basic idea is using a global hash table with a special hash function to store all edges of a 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. In addition, this approach is very easy to implement.

翻译：本文提出了一种用于Trie结构的存储方法，称为坐标哈希Trie。基本思想是使用一个全局哈希表与特殊哈希函数来存储Trie的所有边。对于具有$n$个节点和字母表大小为$m$的Trie，查找、插入和删除子节点的执行时间平均情况为$O(1)$，最坏情况为$O(m)$。该方法使用的空间为$O(n)$，与$m$无关。空间消耗的常数是可预测的，无需重新分配或调整大小。此外，该方法非常易于实现。