期刊文献+

HybridFA:一种基于统计的AC自动机空间优化技术 被引量:3

Hybrid FA: a memory reduction technique for the AC automata based on statistics
下载PDF
导出
摘要 针对高级Aho-Corasick(AC)自动机为提高串匹配速度而造成的空间浪费问题,研究发现数据流对自动机节点的访问规律,据此提出基于数据访问特征的混合自动机构建算法Hybrid FA。分别研究了基于访问频率、访问层次以及结合上述2种特征对AC自动机的部分节点实现完全化的算法。在Snort、Clam AV、URL等真实数据集上的实验结果表明,Hybrid FA算法的存储空间低于高级AC自动机的5%。此外,结合访问频率和访问层次的改进算法在保证匹配速度的同时具有更强的数据适应性。 Despite the fast speed in multiple string matching tasks, the advanced Aho-Corasick(AC) automata wastes storage memory to a great extent. Study indicated that the automata states have specific statistical access characteristics in practice. Accordingly, a series of algorithms based on statistical characteristics for building hybrid finite automata, named Hybrid FA, are proposed. This work completes partial states of the AC automata according to different features, including access frequency, state hierarchy, and combined characteristics respectively. Experimental results on the real-world datasets like Snort, Clam AV, and URL show that the storage space of Hybrid AC is reduced to less than 5% of the space cost by the advanced AC automata. Furthermore, Hybrid FA based on combined characteristics achieves the superior performance on matching speed and robustness comparing to other proposed algorithms.
出处 《通信学报》 EI CSCD 北大核心 2015年第7期31-39,共9页 Journal on Communications
基金 中国科学院战略性科技先导专项基金资助项目(XDA06030602) 国家高技术研究发展计划("863"计划)基金资助项目(2011AA010703) 国家自然科学基金青年基金资助项目(61202477)~~
关键词 多模式串匹配 空间优化 高级AC自动机 统计策略 节点完全化 multiple string matching memory reduction advanced AC automata statistical strategy state completing
  • 相关文献

参考文献14

  • 1ME L, HEYE L, KURI J, et al. A pattern matching based filter for audit reduction and fast detection of potential intrusions[A]. The 3rd International Workshop on the Recent Advances in Intrusion Detec- tion[C]. Toulouse, France, 2000.17-27.
  • 2NAVARRO G, KURI J. Fast Multipattern Search Algorithms for Intrusion Detection[R]. Technical Report TR/DCC-99-11, Dept. of Computer Science, Univ of Chile. 1999.
  • 3VARGHESE G, FIST M. Applying Fast String Matching to Intrusion Detection[R]. Technical Report In preparation, successor to UCSD TR CS2001-0670. University of California, San Diego. 2002.
  • 4AHO A V, CORASICK M J. Efficient slring matching: an aid to biblio- graphic search[J]. Communications of the ACM, 1975, 18(6): 333-340.
  • 5NAVARRO G, RAFF1NOT M. Flexible Pattern Matching in Strings: Practical On-line Search Algorithms for Texts and Biological Se- quences[M]. SIAM Publishing, 2002.
  • 6DENCKER P, DORRE K, HEUFT J. Optimization of parser tables for portable compilers[J]. ACM Transactions on Programming Languages and Systems, 1984, 6(4):546-572.
  • 7AHO A V, SETHI R, ULLMAN J D. Compilers: Principles, Tech- niques, and Tools[M]. Addison-Wesley Publishing, 2006.
  • 8ZIEGLER S. Smaller faster table driven parser[EB/OL], http://www. researchgate.net/publication/242522203_Smaller_faster table driven_ parser. Unpublished manuscript.
  • 9Madison Academic Computing Cen- ter, 1977. AOE J, MORIMOTO0 K, SATO T. An efficient implementation of trie structures[J]. Software-Practice and Experience, 1992, 22(9):695-721.
  • 10刘燕兵,刘萍,谭建龙,郭莉.基于存储优化的多模式串匹配算法[J].计算机研究与发展,2009,46(10):1768-1776. 被引量:6

二级参考文献22

  • 1贺龙涛,方滨兴,余翔湛.一种时间复杂度最优的精确串匹配算法[J].软件学报,2005,16(5):676-683. 被引量:25
  • 2Wu S, Manber U. A fast algorithm for multi-pattern searching, TR-94-17 [R]. Tucson, AZ: Department of Computer Science, University of Arizona, 1994.
  • 3Raffinot M. On the multi backward DAWG matching algorithm (MultiBDM)[C]//Proc of the 4th South American Workshop on String Processing. Valparaiso, Chile: Carleton University Press, 1997:149-165.
  • 4Allauzen C, Crochemore M, Raffinot M. Factor oracle: A new structure for pattern matching [C] //Proc of the 26th Conf on Current Trends in Theory and Practice of Informatics. Berlin: Springer, 1999:295-310.
  • 5Navarro G, Raffinot M. Fast and flexible string matching by combining bit-parallelism and suffix automata [OL]. (2000- 12-01) [2007-12-01]. http://www. jea. acre. org.
  • 6Tarjan R E, Yao A C. Storing a sparse table [J]. Communications of the ACM, 1979, 22(11) : 606-611.
  • 7Fredman M, Komlos J, Szemeredi E. Storing a sparse table with O(1) worst case access time[J]. Journal of the ACM, 1984, :31(3): 538-544.
  • 8Galli N, Seybold B, Simon K. Tetris-hashiog or optimal table compression [J]. Discrete Applied Mathematics, 2001, 110(1): 41-58.
  • 9Dencker P, Durre K, Hcuft J. Optimization of parser tables for portable compilers [J]. ACM Trans on Programming lLanguages and Systems, 1984, (64): 546-572.
  • 10Kiraz G A. Compressed storage of sparse finite state transducers[C]//{roc of the 4th Int Workshop on Implementing Automata. Berling: Springer, 1999:109-121.

共引文献5

同被引文献8

引证文献3

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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