Perbandingan Algoritma String Matching Brute Force dan Rabin-Karp pada Sistem Pencarian Judul Skripsi (Studi Kasus Universitas Bina Darma)
Abstract
Fast and accurate information retrieval for thesis titles is crucial within the academic environment of Universitas Bina Darma to prevent research duplication. The massive increase in data volume demands the implementation of mathematically efficient string matching algorithms. This study aims to compare the performance of the Brute Force and Rabin-Karp algorithms in executing exact matching on a dataset of thesis titles. A quantitative experimental approach was utilized by executing and isolating pure logic computation within a Node.js environment. Measurements focused on execution time and the number of character comparison operations across variations in keyword length, data volume, and worst-case scenarios. Experimental results demonstrate that the Brute Force algorithm consistently outperforms Rabin-Karp in terms of execution speed. In the worst-case scenario, Brute Force required only 20.0970 ms to confirm that a pattern was not found, whereas Rabin-Karp required 42.4836 ms. Based on the comprehensive empirical data, Brute Force is concluded to be the most optimal algorithm for the text characteristics of the thesis title dataset at Universitas Bina Darma, while Rabin-Karp remains advantageous in reducing the number of character comparison operations.
Article Discovery & Scholarly Lookup
DOIAuthor Biographies
Program Studi Teknik Informatika, Fakultas Ilmu Komputer, Universitas Bina Darma, Kota Palembang, Provinsi Sumatera Selatan, Indonesia.
Program Studi Teknik Informatika, Fakultas Ilmu Komputer, Universitas Bina Darma, Kota Palembang, Provinsi Sumatera Selatan, Indonesia.
How to Cite
License & Copyright
This work is licensed under a Creative Commons Attribution 4.0 International License.
This is an open-access journal. All articles are distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Creative Commons Attribution 4.0 International (CC BY 4.0)Under this license, you are free to:
- Share: copy, distribute, and transmit the work in any medium or format.
- Adapt: remix, transform, and build upon the work for any purpose, even commercially.
You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
Copyright and Retention Copyright & Retention Authors retain copyright without restrictions and grant this journal the right of first publication under an open-access model. The journal retains non-exclusive publishing rights for archiving, indexing, and scholarly dissemination.References
Total: 17 References- Al Riansyah, A., & Mirza, A. H. (2023). Pendeteksi mobil berdasarkan merek dan tipe menggunakan algoritma YOLO. SMATIKA: STIKI Informatika Jurnal, 13(2), 241–250.
- Andriansyah, S., Baidarus, B., & Gunawan, R. (2021). Implementasi algoritma Brute Force pada pencarian berita berbasis web. Jurnal Computer Science and Information Technology (CoSciTech), 2(2), 127–134.
- Alan, S. H. (2021). Implementasi algoritma Brute Force dalam pencarian data katalog buku perpustakaan. Jurnal Teknik Informatika dan Sistem Informasi (JURTISI), 1(1), 1–8.
- Danuri. (2016). Pencarian file teks berbasis content dengan pencocokan string menggunakan algoritma Brute Force. Scientific Journal of Informatics, 3(1), 77–86. https://doi.org/10.15294/sji.v3i1.6111
- Ilham, M., & Mirza, A. H. (2020). Penerapan algoritma Knuth Morris Pratt dalam fitur pencarian pengarsipan dokumen pada SMA Plus Negeri 17 Palembang. Journal of Software Engineering Ampera, 1(2), 85–94.
Similar Articles
Explore related articles published in this journal.