Abstract: A Hash table based on Trie-tree was proposed, based on idea the Aho-Corasick (AC) algorithm and the chain-hash. This algorithm, by adding a counter of the subsequent state, could supply simpler and faster information for the follow-up search operations and so on. The analysis and the experiment indicate that this algorithm is of higher efficiency,stronger stability and less energy consumption.

Key words: Aho-Corasick （AC） algorithm, Trie-tree, bitsplit string-matching, chain-hash table, segment hash table

摘要： 受到AC算法与链式哈希的启发，提出了一种基于Trie树的哈希表。该算法通过增加一个后继状态计数器，能够为后续的查找等运算提供更加简单和快速的信息。分析与实验表明该算法具有较高的效率、较强的稳定性，且降低了能耗。

关键词: AC算法, Trie树, 分离位的串匹配, 链式哈希表, 分段哈希表