Improved AC_BMH Algorithm for String Matching

Qing-duan Meng, Xiaoling Zhang, Dongwei Lv
{"title":"Improved AC_BMH Algorithm for String Matching","authors":"Qing-duan Meng, Xiaoling Zhang, Dongwei Lv","doi":"10.1109/ITAPP.2010.5566604","DOIUrl":null,"url":null,"abstract":"An improved AC_BMH (Aho-Corasick_Boyer-Moore-Horspool) algorithm was proposed in this paper, which combines advantages of both double-character skip and QS (Quick Search) algorithm, and increases the jumping distance of pattern string when pattern strings matching fails, at the same time, decreases the amount of memory usage by employing compact storage mechanism. Experiment results show that the matching speed of string is improved by 22.85%-42.79% by using the proposed algorithm, and the amount of memory used reduces about 90% with many pattern strings existed.","PeriodicalId":116013,"journal":{"name":"2010 International Conference on Internet Technology and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Internet Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITAPP.2010.5566604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An improved AC_BMH (Aho-Corasick_Boyer-Moore-Horspool) algorithm was proposed in this paper, which combines advantages of both double-character skip and QS (Quick Search) algorithm, and increases the jumping distance of pattern string when pattern strings matching fails, at the same time, decreases the amount of memory usage by employing compact storage mechanism. Experiment results show that the matching speed of string is improved by 22.85%-42.79% by using the proposed algorithm, and the amount of memory used reduces about 90% with many pattern strings existed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进的AC_BMH字符串匹配算法
本文提出了一种改进的AC_BMH (Aho-Corasick_Boyer-Moore-Horspool)算法,该算法结合了双字符跳跃和QS (Quick Search)算法的优点,在模式字符串匹配失败时增加了模式字符串的跳跃距离,同时通过采用紧凑的存储机制减少了内存的使用量。实验结果表明,该算法可将字符串匹配速度提高22.85% ~ 42.79%,在存在多模式字符串的情况下,减少约90%的内存占用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Application of Multimedia Courses in Academic Library Freshmen Instruction A New Operation Model of E-Business Incentive Mechanism Design on Human Capital Pricing of Enterprise A LDA-Based Approach for Interactive Web Mining of Topic Evolutionary Patterns Design and Implementation of Remote Parallel Computing System Based on Multi-Platform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1