Analisis Perbandingan Algoritma Pencarian Jenis Tanaman Hias dengan Menggunakan Penerapan Metode Perbandingan Eksponensial

F Fauziah(1*), Aris Gunaryati(2), N Nurhayati(3), Frenda Farahdinna(4), K Kaeren(5),

(1) Universitas Nasional, Indonesia
(2) Universitas Nasional, Indonesia
(3) Universitas Nasional, Indonesia
(4) Universitas Nasional, Indonesia
(5) Universitas Nasional, Indonesia
(*) Corresponding Author

Abstract


The process of searching data manually certainly takes a long time, therefore a system is needed that can speed up the data search process, especially ornamental plant data. In this study, two algorithms were used to compare the optimal data search process according to the type of data being collected. The data used are ornamental plant data. The two algorithms used are Knuth Morris Pratt and Boyer Moore. The process is carried out by comparing text and existing patterns based on the type of character that is carried out in this test and utilizing the exponential comparison method with a value comparison of 109.13 using the Boyer Moore algorithm and 139.19 with the Knuth Morris Pratt algorithm so that the type of Boyer Moore algorithm can be known faster than Knuth Morris Pratt for text searches related to the types of ornamental plants in the trial in this study.

Full Text:

PDF

References


Y. R. Rasi, I. N. Farida, and R. K. Niswatin, “Implementasi Algoritma Quicksort dan Binary Search pada Fitur Pencarian Media Sosial Star,” in Seminar Nasional Inovasi dan Teknologi, Kediri: UN PGRI Kediri, Jul. 2020, pp. 121–128. doi: https://doi.org/10.29407/inotek.v4i1.183.

Y. N. Daniati, I. A. Zulkarnain, and K. Nurfitri, “Penerapan Algoritma Levenshtein Distance pada Sistem Pencarian Data Buku Berbasis Web,” KOMPUTEK, vol. 6, no. 1, p. 81, Apr. 2022, doi: 10.24269/jkt.v6i1.1144.

M. Fazira, “Perbandingan Algoritma Knuth-Morris-Pratt dan Boyer Moore dengan Metode Perbandingan Eksponensial pada Aplikasi Kamus Bahasa Indonesia-Jerman Berbasis Android,” Majalah Ilmiah INTI, vol. 6, no. 2, 2019.

A. Fau, Mesran, and G. Leonarde Ginting, “Analisa Perbandingan Boyer Moore Dan Knuth Morris Pratt Dalam Pencarian Judul Buku Menerapkan Metode Perbandingan Eksponensial (Studi Kasus: Perpustakaan STMIK Budi Darma),” Jurnal Times, vol. VI, no. 1, pp. 12–22, 2017.

F. A. T. Tobing and R. Nainggolan, “Analisis Perbandingan Penggunaan Metode Binary Search dengan Reguler Search Expression,” Jurnal Manajemen Informatika dan Komputerisasi Akuntansi, vol. 4, no. 2, pp. 168–172, Oct. 2021, doi: 10.46880/jmika.Vol4No2.pp168-172.

J. Pardede, A. N. Hermana, and G. Swarghani, “Perbandingan Metode Breadth First Search dan Backlink pada Web Crawler,” MIND Journal, vol. 2, no. 2, pp. 61–69, Nov. 2018, doi: 10.26760/mindjournal.v2i2.61-69.

A. Triawan and R. S. Sofyan, “Penerapan Algoritma Booyer Moore Untuk Efisiensi Pencarian Data Letak Kendaraan Pada Aplikasi Gudang Dealer SETIAJAYA TOYOTA,” Teknois : Jurnal Ilmiah Teknologi Informasi dan Sains, vol. 7, no. 2, pp. 27–36, Aug. 2019, doi: 10.36350/jbs.v7i2.25.

K. A. Khairan and H. Ahmadian, “Penerapan Algoritma Knuth-Morris-Pratt pada Fitur Pencarian Definisi Istilah Standar Operasional Prosedur (SOP) pada Lembaga Penjaminan Mutu UIN Ar-Raniry,” Cyberspace: Jurnal Pendidikan Teknologi Informasi, vol. 3, no. 1, p. 26, May 2019, doi: 10.22373/cj.v3i1.4723.

I. Maulana, “Penerapan Algoritma Knuth-Morris-Pratt pada Fungsi Pencarian Dokumen untuk Sistem Informasi Administrasi Sekolah Berbasis Website,” International Journal of Artificial Intelligence, vol. 6, no. 1, pp. 1–20, Sep. 2019, doi: 10.36079/lamintang.ijai-0601.30.

P. Katemba and Niklinton Nehemia Neolak, “Penerapan Metode Perbandingan Exponensial (MPE) Penentuan Penerimaan Beras Sejahtera (RASTRA) di Desa Tobu,” Elkom: Jurnal Elektronika dan Komputer, vol. 14, no. 2, pp. 339–349, Dec. 2021, doi: 10.51903/elkom.v14i2.530.




DOI: https://doi.org/10.30645/brahmana.v4i2.195

DOI (PDF): https://doi.org/10.30645/brahmana.v4i2.195.g194

Refbacks

  • There are currently no refbacks.


Published Papers Indexed/Abstracted By: