基于Trie树的哈希表  

Hash table based on Trie-tree

作　　者：史长琼[1,2] 唐铭[1] 张大方[2] 周恺卿[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,长沙410114 [2]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机应用》2010年第8期2193-2196,共4页journal of Computer Applications

基　　金：湖南省自然科学基金资助项目(09JJ6094)

摘　　要：受到AC算法与链式哈希的启发,提出了一种基于Trie树的哈希表。该算法通过增加一个后继状态计数器,能够为后续的查找等运算提供更加简单和快速的信息。分析与实验表明该算法具有较高的效率、较强的稳定性,且降低了能耗。A Hash table based on Trie-tree was proposed based on idea the Aho-Corasick AC algorithm and the chainhash.This algorithm by adding a counter of the subsequent state could supply simpler and faster information for the followup search operations and so on.The analysis and the experiment indicate that this algorithm is of higher efficiency stronger stability and less energy consumption.

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

分 类 号：TP393[自动化与计算机技术—计算机应用技术]