Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
