Analysis of the Enhanced Boyer-Moore Search Algorithm for a Desktop PC Search Engine
DOI:
https://doi.org/10.69478/JITC2023v5n2a05Abstract
In the digital era, the volume of digital contents stored on personal computers has been rapidly and continuously increasing. Finding documents among this bulk of files has become tedious and stressful. In this regard, string searching and pattern matching algorithms must be employed to alleviate the performance of search engines, making it easier to find the desired documents. This paper aims to analyze the performance of an enhanced Boyer-Moore (BM) search algorithm to assist in finding the intended information or files. A series of tests have been conducted in order to compare the enhanced BM algorithm with the traditional BM algorithm. The results have shown that the Enhanced Boyer-Moore Algorithm performed the search and managed to speed up the searching process by reducing the time duration and the accuracy of the overall performance as the input text increased.
References
BeyondVerse, “Algorithms for String Manipulation and Matching”, Medium, https://www.medium.com/@beyond_verse/algorithms-for-string-manipulation-and-matching-2f9a450ffd7b.
J. Simoes, “What is a Computer Search Engine”, lookeen.com, https://lookeen.com/blog/what-is-a-computer-search-engine.
B. Cole, “Search Engines Tackle the Desktop”, Computer, vol. 38, no. 3, March 2005, pp.14-17, https://doi.org/10.1109/MC.2005.103.
J. Y. Lemos, A. R. Joshi, “Search engine optimization to enhance user interaction”, in Proc. of 2017 International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC), Palladam, India, February 10-11, 2017, https://doi.org/10.1109/I-SMAC.2017.8058379.
Google Search, “Explore the world of Google Search”, https://www.google.com/search/howsearchworks/.
M. Gou, “Algorithms for String matching”, Semantic Scholar, https://www.semanticscholar.org/paper/Algorithms-for-String-matching-Gou/ecb62b50132285d2a47cae7b8daec97db3047a96.
H. F. Mahmood, “The naive algorithm for pattern searching”, Educative, https://www.educative.io/answers/the-naive-algorithm-for-pattern-searching.
D. E. Knuth, J. H. Morris Jr., V. R. Pratt, “Fast Pattern Matching in Strings”, SIAM Journal on Computing, vol. 6, no. 2, 1977, pp.323–350, https://doi.org/10.1137/0206024.
R. S. Boyer, J. S. Moore, “A Fast String Searching Algorithm”, Communications of the ACM, vol. 20, no. 10, October 1977, pp.762-772, https://doi.org/10.1145/359842.359859.
A. Hume, D. Sunday, “Fast string searching”, Software: Practice and Experience, vol. 21.no. 11, November 1991, pp.1221-1248, https://doi.org/10.1002/spe.4380211105.
Programiz, “Rabin-Karp Algorithm”, https://www.programiz.com/dsa/rabin-karp-algorithm.
N. Horspool, “Practical fast searching in strings”, Software: Practice and Experience, vol. 10, no. 6, June 1980, pp. 501-506, https://doi.org/10.1002/spe.4380100608.
B. Langmead, “Boyer-Moore”, https://www.cs.jhu.edu/~langmea/resources/lecture_notes/boyer_moore.pdf.
Downloads
Published
License
Copyright (c) 2023 Lorlyn S. Sernicula, Melinda L. Manalo, Gryam Abner M. Niebre , Rajean C. Anastacio, Jhona P. Alagos, Jason P. Sermeno
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
