Perbandingan Algoritma Raita Dan Apostolico Crochemore Untuk Pencarian Data Perpustakaan Menggunakan Metode Eksponensial
Abstract
The Raita and Apostolico Crochemore algorithms are string matching algorithms that can be used to simplify the search process for a search engine. The two algorithms have different search characteristics to find string matching results. Algorithms that have more optimal speed in string matching will certainly be more useful. In this study, the authors compare the two algorithms using the Exponential Method so that it is easy to find out which method is more optimal in searching between the two algorithms. A case study in string matching is used to compare the two methods, namely in the process of searching for library data that the author will build using Visual Basic Net 2008.
References
[2] B. N. Sri Sugiarti, “Implementasi Algoritma Zhu Takaoka Pada Aplikasi Olshop Kamera Digital,” JURIKOM (Jurnal Ris. Komputer), 2020.
[3] D. R. Bawanto and N. Rosmawanti, “Perbandingan Algoritma Binary Search Dan Raita Dalam Pencarian Data,” pp. 1311–1317.
[4] S. A. T, “perbandingan algoritma Raita dan algoritma Berry Ravindran dalam pencocokan string pada aplikasi kamus Indonesia-Korea,” vol. 1, no. 2, pp. 6–38, 2019.
[5] A. M. S. Mamta Culkari Puding, Jumadil Nangi, “perbandingan algoritma Horspool dan algoritma Raita pada aplikasi istilah psikologi berbasis android,” vol. 5, no. 13512025, pp. 1–13, 2019.
[6] H. K. Siregar, “Perbandingan Algoritma Knuth Morris Pratt dan Algoritma Apostolico Crochemore pada Aplikasi Kamus Bahasa Indonesia,” 2017.
[7] S. Basuki, Pengantar Ilmu Perpustakaan. Jakarta: Universitas Terbuka, 2009.
[8] Kamara, Visualisasi Beberapa Algoritma Pencocokan String Dengan Java. Bandung: Institut Teknologi Bandung, 2008.
[9] A. Sonita and Khairunnisyh, “The 8 th University Research Colloquium 2018 Universitas Muhammadiyah Purwokerto IMPLEMENTASI ALGORITMA STING MATCHING PADA RANCANG BANGUN IMPLEMENTATION OF STRING MATCHING ALGORITHM ON THE DESIGN OF DRUG The 8 th University Research Colloquium 2018 Unive,” no. 4, pp. 124–128, 2018, [Online]. Available: http://repository.urecol.org/index.php/proceeding/article/view/491.
[10] J. I. Sinaga, M. Mesran, and E. Buulo, “Aplikasi Mobile Pencarian Kata Pada Arti Ayat Al-Qur ’ an Berbasis Android Menggunakan ...,” J. INFOTEK, vol. II, no. Juni 2016, pp. 68–72, 2016.
[11] S. & Munir, Pencocokan String Berdasarkan Kemiripan Ucapan (Phonetic String Matching) dalam Bahasa Inggris. Yogyakarta: SNATI UII, 2005.
[12] N. Marbun, M. Zarlis, D. Hartama, and B. J. D. Sitompul, “Implementasi Algoritma Raita Pada Pencarian Katalog Alkes,” pp. 520–523, 2019.
[13] C. and Lecroq, Handbook of Exact String Matching Algorithms, 238th ed. 2004.
[14] S. G. Ratri, “Penggunaan Algoritma Apostolico-Crochemore Pada Proses Pencarian String di Dalam Teks,” 2007.
[15] A. Fau, Mesran, and G. L. Ginting, “Analisa Perbandingan Boyer Moore Dan Knuth Morris Pratt Dalam Pencarian Judul Buku Menerapkan Metode Perbandingan Eksponensial ( Studi Kasus : Perpustakaan STMIK Budi Darma ),” J. Times (Technology Informatics Comput. Syst., vol. 6, no. 1, pp. 12–22, 2017.
[16] A. Nugroho, Rekayasa Perangkat Lunak Berbasis Objek dengan Metode USDP. Yogyakarta: Andi, 2010.
[17] R. A.S-M.Shalahuddin, Rekayasa Perangkat Lunak (Terstruktur dan Berorientasi Objek). Bandung: Informatika, 2014.
[18] W. Komputer, Membuat Aplikasi Client Server dengan Visual Basic 2008. Yogyakarta: Andi, 2010.
[19] B. Nugroho, Panduan proyek sistem penjualan retail mini market. Yogyakarta: Andi, 2012.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Perbandingan Algoritma Raita Dan Apostolico Crochemore Untuk Pencarian Data Perpustakaan Menggunakan Metode Eksponensial
Pages: 70-81
Copyright (c) 2023 Herman Krismon Simbolon

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).


