An Enhancement of Boyer-Moore Algorithm Using Hash Table

John Michael M. Domingo; Mark Dave C. Martin; Vivien A. Agustin

doi:10.36948/ijfmr.2024.v06i06.32548

An Enhancement of Boyer-Moore Algorithm Using Hash Table

Author(s)	John Michael M. Domingo, Mark Dave C. Martin, Vivien A. Agustin
Country	Philippines
Abstract	Purpose This study aims to enhance the Boyer-Moore algorithm by integrating hash tables to improve efficiency in handling large datasets and complex patterns. The enhancement addresses challenges of increased execution time and memory usage in text processing tasks. Method The proposed algorithm incorporates hash tables to optimize pattern preprocessing and matching, enabling faster data access and reducing redundant computations. Performance was evaluated by testing both the original and enhanced algorithms on datasets ranging from 100,000 to over 5 million characters. Results The enhanced algorithm demonstrated a 16.39% improvement in execution time, processing 5,289,118 characters in 1.64 seconds compared to 1.96 seconds for the original. Memory usage was also reduced by approximately 1,210 KB across dataset sizes, showcasing its scalability and resource efficiency. Conclusion The integration of hash-based structures into the Boyer-Moore algorithm significantly enhances its runtime and memory performance without compromising accuracy. These improvements make it highly suitable for real-time applications such as content moderation, search engines, and large-scale data analytics. Recommendations Future studies should explore hybrid algorithms, advanced data structures, and multilingual datasets to further optimize performance and validate adaptability. Research Implications The enhanced algorithm provides a robust solution for real-time text processing, supporting industries that rely on efficient, large-scale analytics. Practical Implications Industries such as data analytics and content moderation can adopt this algorithm to meet growing demands for scalable and efficient computational tools. Social Implications Improved text-processing efficiency supports faster, more accurate content moderation, fostering safer and more respectful online environments.
Keywords	Keywords: Boyer-Moore, hash map, string matching, pattern, hash-based data structure, execution time.
Field	Computer > Logic
Published In	Volume 6, Issue 6, November-December 2024
Published On	2024-12-17
Cite This	An Enhancement of Boyer-Moore Algorithm Using Hash Table - John Michael M. Domingo, Mark Dave C. Martin, Vivien A. Agustin - IJFMR Volume 6, Issue 6, November-December 2024. DOI 10.36948/ijfmr.2024.v06i06.32548
DOI	https://doi.org/10.36948/ijfmr.2024.v06i06.32548
Short DOI	https://doi.org/g8wkpj

View / Download PDF File

E-ISSN 2582-2160

doi

CrossRef DOI is assigned to each research paper published in our journal.

IJFMR DOI prefix is
10.36948/ijfmr

Downloads

Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 6 Isu 6 Cover Page Vol 6 Isu 5 Cover Page Vol 6 Isu 4

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9898-5948-55	editor@ijfmr.com

International Journal For Multidisciplinary Research

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

An Enhancement of Boyer-Moore Algorithm Using Hash Table

Share this