期刊文献+

基于有序二叉树的多模式匹配算法

Multiple Pattern Matching Algorithm Based on Sequential Binary Tree
下载PDF
导出
摘要 匹配算法是入侵检测系统中的核心,它的快慢在很大程度上决定着整个系统的性能,在多模式匹配算法的基础上采用有序二叉树的方式存储入侵规则,并使用一定的规则来访问二叉树实现快速匹配,具有更大的搜索步长和更高的效率。 Matching algorithm is the core of the Intrusion Detection System, whose speed decides the whole function of the system. The new algorithm uses the structure of sequential binary tree to store the rules of intrusion based on multiple pattern matching, and realizes quick matching by using the rule to access the binary tree. So it has a better searching step and efficiency.
作者 宋志鹏 任佳
出处 《计算机安全》 2009年第10期63-65,共3页 Network & Computer Security
关键词 入侵检测 多模式匹配 有序二叉树 Intrusion Detection multiple pattern matching sequential binary tree
  • 相关文献

参考文献2

二级参考文献7

  • 1[1]Aho A V, Corasick M J, Efficient string matching: an aid to bibliographic search[J]. Comm. ACM, 1975,18(6):333-340.
  • 2[2]Lewis H R, Papadimitriou C H, Elements of the theory of computation (Second Edition)[M]. Prentice~Hall International, Inc. 1998.
  • 3[3]Fan J J, Su K Y, An efficient algorithm for match multiple patterns[J]. IEEE Trans. on Knowledge and Data Engineering, 1993, 5(2):339-351.
  • 4[4]Shaffer C A, A practice introduction to data structures and algorithm analysis[M]. New York Prentice Hall, 1997.
  • 5[5]Chen Gui-lin. Some technology research in automatic abstract[D]. Shanghai Jiaotong University, Shanghai China, 2000,4 (In Chinese).
  • 6[6]Boyer R S, Moore J S, A fast string searching algorithm[J]. Comm. ACM, 1977, 20(10): 762-772.
  • 7[7]Sunday D M, A very fast substring search algorithm[J]. Comm. ACM, 1990, 33(8):132-142.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部