CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value)

by Akhtar Rasool, Nilay Khare
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 72 - Number 1
Year of Publication: 2013
Authors: Akhtar Rasool, Nilay Khare
10.5120/12455-8781

Akhtar Rasool, Nilay Khare . Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value). International Journal of Computer Applications. 72, 1 ( June 2013), 1-6. DOI=10.5120/12455-8781

@article{ 10.5120/12455-8781,
author = { Akhtar Rasool, Nilay Khare },
title = { Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value) },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 72 },
number = { 1 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume72/number1/12455-8781/ },
doi = { 10.5120/12455-8781 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:36:44.125971+05:30
%A Akhtar Rasool
%A Nilay Khare
%T Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value)
%J International Journal of Computer Applications
%@ 0975-8887
%V 72
%N 1
%P 1-6
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

BM (Boyer-Moore) string matching algorithm and its enhanced versions like BMH and BMHS are a standard benchmark for single pattern string matching. Based on BMH and BMHS algorithms we have developed improved algorithms EBMH(Enhanced BMH)and EBMHS(Enhanced BMHS). These algorithms uses the newly introduced PDJ (possible double jump) and MValue(Match Value) concepts. While searching these concepts helps to provide longer jump of characters. The algorithm EBMH emphasize on BMH algorithm with the inclusion of PDJ and MValue and the algorithm EBMHS emphasize on BMHS algorithm with the inclusion of PDJ and MValue. Through these algorithm the number of comparison of characters between text and pattern are reduced to a significant amount. In this paper PDJ, MValue, EBMH and EBMHS are described and analyzed. Experimental results show that in the algorithms searching time is reduced as compared to BM, BMH, and BMHS. The algorithms are analyzed on the basis of time requirement in best, worst and average case.

References
  1. Pei-fei Wu, "The Research and Amelioration of Pattern-matching Algorithm in Intrusion Detection System", In the proc. IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS), June 2012, pp. 1712-1715.
  2. Qingduan Meng, Xiaoling Zhang, Dongwei Lv, "Research on Detection Speed Improvement of Snort", In the proc. Internet Technology and Applications, Aug. 2010, pp. 1-5.
  3. Lin, Pi-yuan, Shaopeng Liu, Lixia Zhang, Peijie Huang, "Compressed Pattern Matching in DNA Sequences Using Multithreaded Technology", In the proc. 3rd International Conference on Bioinformatics and Biomedical Engineering ,ICBBE 2009, June 2009, pp. 1-4.
  4. Pei-fei Wu, "The Research and Amelioration of Pattern-matching Algorithm in Intrusion Detection System" , In the proc. 9th International Conference on Embedded Software and Systems (HPCC-ICESS), June 2012, pp. 1712-1715
  5. Jingbo Yuan, Jinsong Yang, Shunli Ding, "An Improved Pattern Matching Algorithm Based on BMHS", In the proc. 11th International Conference on Distributed Computing and Applications to Business, Engineering & Science (DCABES), Oct. 2012, pp. 441-445.
  6. Yuting Han, Guoai Xu, "Improved algorithm of pattern matching based on BMHS", In proc. IEEE International Conference on Information Theory and Information Security (ICITIS), Dec. 2010, pp 238-241.
  7. Liu Zhen, Xu Su, Zhang Jue,"Improved Algorithm of Pattern Matching for Intrusion Detection" , In proc. International Conference on Multimedia Information Networking and Security, Nov. 2009, pp. 446-449.
  8. Yuting Han, Guoai Xu, "Improved Algorithm of Pattern Matching based on BMHS", In proc. IEEE International Conference on Information Theory and Information Security (ICITIS), Dec. 2010, pp. 238-241.
  9. Lin quan Xie, Xiao ming Liu, Guangxue Yue, "Improved Pattern Matching Algorithm of BMHS", In proc. International Conference on Information Science and Engineering (ISISE), Dec. 2010, pp. 616-619.
  10. R. S. Boyer, and J. S. Moore, "A Fast String Searching Algorithm", Communications of the ACM, 1977, 20(10):762-772.
  11. R. N. Horspool, "Practical Fast Searching in Strings", Software Practice and Experience, 1980, 10(6):501-506.
  12. Yuan, Lingling, "An improved algorithm for boyer-moore string matching in chinese information processing", In proc. International Conference on Computer Science and Service System (CSSS), June 2011, pp. 182-184.
  13. Xiong, Zhengda, "A Composite Boyer-Moore Algorithm for the String Matching Problem ", In proc. International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), Dec. 2010, pp. 492-496.
  14. Qingduan Meng, Xiaoling Zhang, Dongwei Lv, "Improved AC_BMH Algorithm for String Matching", In the proc. Internet Technology and Applications, Aug. 2010, pp. 1-5.
  15. Yong-qiang, Zhu, "Two Enhanced BM Algorithm in Pattern Matching", In proc Conference on Digital Media and Digital Content Management (DMDCM) , May 2011, pp. 341-346.
Index Terms

Computer Science
Information Sciences

Keywords

String Matching BM BMH BMHS Improved BMHS PDJ MValue EBMH EBMHS

Powered by PhDFocusTM