{"title":"改进的AC_BMH字符串匹配算法","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":"{\"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}","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}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
