Research Article
Performance Comparative Analysis Boyer Moore, Horspool, Zhu Takaoka Algorithms on the Indonesian Translation Hadith Bukhori
@INPROCEEDINGS{10.4108/eai.2-10-2018.2295593, author={Nindy Raisa Hanum and Imam Marzuki Shofi and Siti Ummi Masruroh and Muhammad Taufik Rusydi and Muhammad Afied Hambali}, title={Performance Comparative Analysis Boyer Moore, Horspool, Zhu Takaoka Algorithms on the Indonesian Translation Hadith Bukhori}, proceedings={Proceedings of the 2nd International Conference on Quran and Hadith Studies Information Technology and Media in Conjunction with the 1st International Conference on Islam, Science and Technology, ICONQUHAS \& ICONIST, Bandung, October 2-4, 2018, Indonesia}, publisher={EAI}, proceedings_a={ICONQUHAS}, year={2020}, month={5}, keywords={algorithm analysis boyer moore algorithm horspool algorithm zhu takaoka algorithm runtime memory consumption simulation method}, doi={10.4108/eai.2-10-2018.2295593} }- Nindy Raisa Hanum
Imam Marzuki Shofi
Siti Ummi Masruroh
Muhammad Taufik Rusydi
Muhammad Afied Hambali
Year: 2020
Performance Comparative Analysis Boyer Moore, Horspool, Zhu Takaoka Algorithms on the Indonesian Translation Hadith Bukhori
ICONQUHAS
EAI
DOI: 10.4108/eai.2-10-2018.2295593
Abstract
Along with the times, technological advances are increasing, especially information technology. This encourages the emergence of new innovations in the presentation of digital information. String matching (string matching) is a necessity in presenting information, especially in text search. Therefore, a string matching algorithm is needed which is used to search for one or more strings in a set of strings (text). This research was conducted to compare the performance of several String Matching Algorithms, such as Boyer Moore, Horspool, and Zhu Takaoka Algorithms in the string search process. To assess the performance of the algorithm, this study uses runtime parameters and memory consumption. Both parameters must have the smallest possible value to get the best performance value. The input parameters in this study are several characters and a number of words divided into several scenarios and outputs from this research are runtime and memory consumption. Both parameters are calculated using the Exponential Comparison Method (MDE) to find out the best results. The final result of this study shows that the Boyer Moore algorithm shows the best memory consumption and the Zhu Takaoka Algorithm produces the best runtime. And the calculation results Rank Exponential Comparison Method The algorithm shows Boyer Moore in the first position, then Horspool, and Zhu Takaoka in the last position.