Komparasi Kinerja Algoritma String Matching berbasis Hash, Character dan Word-Compress Based Pada Website Arsip Pengaduan
Jurnal Informatika: Jurnal Pengembangan IT · 04.11.2026 · 11 (3) · 947-958
DOI: 10.30591/jpit.v11i3.16 ↗Kurz gefasst
Fachartikel in der Zeitschrift Jurnal Informatika: Jurnal Pengembangan IT, online erschienen am 04.11.2026. Verfasst von Nurcahya Pradana Taufik Prakisya und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Information systems are of paramount importance in facilitating the data collection process, especially for large and complex datasets. To improve the process of collecting customer complaints, particularly those related to PDAM Tirta Kahuripan, it is necessary to optimize the search and matching of complaint data within the information system. The previous system experienced crashes due to high memory usage. To address this issue, a String-Matching algorithm is implemented to enhance the efficiency of the search process in detecting data patterns. By applying the hash-based String-Matching algorithm (LsHashq) and character-based algorithms, namely Boyer-Moore-Horspool (BMH) and Knuth-Morris-Pratt (KMP), the study groups complaint data samples using a disproportional sampling method and evaluates accuracy, recall, and precision through a confusion matrix. The final performance values are calculated using the Exponential Comparison Method (MPE). The hash-based String-Matching algorithm (LsHashq) demonstrates an average runtime advantage of 0.545s and a memory consumption of 17.9 KB, with an MPE decision value of 14.922. The first character-based algorithm, Boyer-Moore-Horspool (BMH), has an average runtime of 0.6702s and a memory consumption of 17.6 KB, with an MPE decision value of 15.067. The third character-based algorithm, Knuth-Morris-Pratt (KMP), has an average runtime of 0.7554s and a memory consumption of 17.7 KB, with an MPE decision value of 15.211.
Zitieren
APA
Prakisya, N. P. T., Wiryansyah, S., & Yuana, R. A. (2026). Komparasi Kinerja Algoritma String Matching berbasis Hash, Character dan Word-Compress Based Pada Website Arsip Pengaduan. Jurnal Informatika: Jurnal Pengembangan IT, 11(3), 947-958. https://doi.org/10.30591/jpit.v11i3.16
Vancouver
Prakisya NPT, Wiryansyah S, Yuana RA. Komparasi Kinerja Algoritma String Matching berbasis Hash, Character dan Word-Compress Based Pada Website Arsip Pengaduan. Jurnal Informatika: Jurnal Pengembangan IT. 2026;11(3):947-958. doi:10.30591/jpit.v11i3.16
BibTeX
@article{Prakisya2026,
author = {Prakisya, Nurcahya Pradana Taufik and Wiryansyah, Salman and Yuana, Rosihan Ari},
title = {Komparasi Kinerja Algoritma String Matching berbasis Hash, Character dan Word-Compress Based Pada Website Arsip Pengaduan},
journal = {Jurnal Informatika: Jurnal Pengembangan IT},
year = {2026},
volume = {11},
number = {3},
pages = {947--958},
doi = {10.30591/jpit.v11i3.16}
}
EUVIMED