计算机应用 ›› 2010, Vol. 30 ›› Issue (8): 2193-2196.

• 软件过程处理 • 上一篇    下一篇

基于Trie树的哈希表

史长琼1,唐铭2,张大方1,周恺卿1   

  1. 1.
    2. 长沙理工大学
  • 收稿日期:2010-02-07 修回日期:2010-03-13 发布日期:2010-07-30 出版日期:2010-08-01
  • 通讯作者: 唐铭
  • 基金资助:
    湖南省自然科学基金

Hash table based on Trie-tree

  • Received:2010-02-07 Revised:2010-03-13 Online:2010-07-30 Published:2010-08-01
  • Supported by:
    the Natural Science Foundation of Hunan Province

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

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

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