Prana Pangestu, Shinta Estri Wahyuningrum


Boyer-Moore is one of the algorithms used for the search words that is said to be one of the fastest to complete the search process. This project aims to implement hash table and see the effect it has in the searching process. A hash table is a table that contains key that maps to a value using a hash function. By doing so, the hash table should improve the speed of searching process. The vanilla version of Boyer-Moore will be used as the baseline to test the speed and accuracy of this method and check whether further improvement are needed.


boyer-moore, hash table, string searching, searching, sequential search algorithm

Full Text:



K. Argakusumah and S. Hansun, “Implementasi Algoritma Boyer-Moore pada Aplikasi Kamus Kedokteran Berbasis Android,” ULTIMATICS, vol. 6, p. 70, Dec. 2014, doi: 10.31937/ti.v6i2.340.

H. Umam, S. Hardienata, and A. Chairunnas, “Implementasi Algoritma Pencarian Sequential Search pada Ensiklopedia Ikan Hias Air Tawar berbasis Android.”

F. Rui and TakaokaT, “On improving the average case of the Boyer-Moore string matching algorithm,” Journal of Information Processing, Jul. 1988, Accessed: Feb. 04, 2021. [Online]. Available: https://dl.acm.org/doi/abs/10.5555/50803.50808.

R. Sedgewick and K. Wayne, Algorithms, 4th Edition. Addison-Wesley, 2011.

R. Muth and U. Manber, “Approximate multiple string search,” in Combinatorial Pattern Matching, Jun. 1996, pp. 75–86, doi: 10.1007/3-540-61258-0_7.

R. S. Boyer, M. Kaufmann, and J. S. Moore, “The Boyer-Moore theorem prover and its interactive enhancement,” Computers & Mathematics with Applications, vol. 29, no. 2, pp. 27–62, Jan. 1995, doi: 10.1016/0898-1221(94)00215-7.

DOI: https://doi.org/10.24167/proxies.v2i1.3195

Copyright (c) 2021 PROXIES

View My Stats