Implementasi Algoritma Boyer-Moore Dalam Sistem Penelusuran Katalog Pada Perpustakaan
Keywords:
Algoritma Boyer-Moore, katalog, perpustakaanAbstract
Perpustakaan sebagai penyedia informasi yang representative. Artinya kehidupan dan keberadaan perpustakaan dapat menjadi rantai sejarah bagi masa lalu, akar bagi hidup dimasa sekarang ini dan pembimbing untuk melangkah ke masa depan. Pelayanan informasi terdiri dari lima aspek yaitu pengumpulan informasi, pelestarian informasi, pengolahan informasi, pemanfaatan informasi dan penyebarluasan informasi. Sistem penelusuran merupakan salah satu bagian dari pengolahan dan pemanfaatan informasi, dibeberapa sekolah khususnya di SMA Islam Terpadu Yabis Bontang, penelusuran buku masih belum terkomputerisasi, pencarian atau penelusuran manual menyebabkan kegiatan operasional tidak efektif dan berjalan lambat, dari permasalahan di sekolah tersebut diperlukan suatu sistem yang dapat memecahkan permasalahan sehingga dapat mempermudah pengunjung perpustakaan. Sistem penelusuran yang akan dibangun memerlukan algoritma pencarian string. Algoritma Boyer–Moore ini dianggap sebagai algoritma yang paling efisien dalam implementasi penelusuran katalog buku pada perpustakaan. Alat bantu pengembangan sistemnya menggunakan flowchat, dan metode pengembangan menggunakan waterfall dengan tahapan pengembangannya adalah analisis, desain, coding, pengujian dan pemeliharaan. Teknik pengumpulan data terdiri data sekunder diperoleh dengan mempelajari studi literatur yang berupa tulisan atau dokumen, data primer berasal dari lokasi pengkajian secara langsung, selain itu pengumpulan data melalui observasi juga dilakukan, yaitu pengamatan langsung tentang cara kerja sistem, permasalahan sistem, data inputan sistem, proses dan keluaran sistem yang ada.References
Ahmad Rofiq, Hakim, Yusnita Amelia, and Winarni Theresia Deska., 2013. "Waterfall Model Application In Development Dorm Student Information Management System West Kutai." International Conference on Information Systems for Business Competitiveness (ICISBC 2013), pp.361-365
Aulia, Rama., 2008. "Analisis Algoritma Knuth Morris Pratt dan Algoritma Boyer Moore dalam Proses Pencarian String." Makalah If2251 Strategi Algoritmik, pp. 1-5.
Fernando, Hary., 2009. "Perbandingan dan pengujian beberapa algoritma pencocokan string." Makalah IF2251, pp.1-7.
Minandar, Arie, Andri Tanoto, and Davis Tanadi., 2010. "Aplikasi Algoritma Pencarian String Boyer-Moore Pada Pencocokan DNA." Departemen Teknik Informatika, Institut Teknologi , pp.1-3
Pertiwi, Dini Hari., 2011 "Desain dan Implementasi Sistem Informasi Perpustakaan Berbasis WEB dengan MVC (Model View Controler). " Jurnal Teknologi Informatika (TEKNOMATIKA) 1, pp. 1-23
Pressman, Roger S., 2003. Rekayasa Perangkat Lunak Pendekatan Praktis (Buku Satu)”. Yogyakarta: Andi & McGraw-Hill Book Co.
Rahmanita, Eza., 2016. "Pencarian String Menggunakan Algoritma Boyer Moore Pada Dokumen." Network Engineering Research Operation [Nero] 1.1, pp.15-26
Sagita, Vina, And Maria Irmina Prasetiyowati., 2013."Studi Perbandingan Implementasi Algoritma Boyer- Moore, Turbo BoyerMoore, Dan Tuned Boyer-Moore Dalam Pencarian String." Ultimatics 5.1, pp.31-37
Sutedjo, Budi Dan An, Michael., 2002 “Algoritma Dan Teknik Pemrograman Konsep, Implementasi, Dan Aplikasi“. Yogyakarta:Andi.
Yugianus, Pausta., 2011. “ Implementasi Algoritma Boyer-Moore Dalam Sistem Penelusuran Katalog Perpustakaan Sekolah. Diss. Universitas Pendidikan Indonesia, pp 1-20
Downloads
Published
Issue
Section
License
Copyright Transfer StatementThe copyright to this article is transferred to Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) . The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment.
We declare that:
- This paper has not been published in the same form elsewhere.
- It will not be submitted anywhere else for publication prior to acceptance/rejection by this Journal.
Furthermore, I/We hereby transfer the unlimited rights of publication of the above-mentioned paper in whole to Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) . The copyright transfer covers the exclusive right to reproduce and distribute the article, including reprints, translations, photographic reproductions, microform, electronic form (offline, online) or any other reproductions of similar nature.
The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.
Retained Rights/Terms and Conditions
- Authors retain all proprietary rights in any process, procedure, or article of manufacture described in the Work.
- Authors may reproduce or authorize others to reproduce the Work or derivative works for the author’s personal use or for company use, provided that the source and the JIM copyright notice are indicated, the copies are not used in any way that implies Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) endorsement of a product or service of any employer, and the copies themselves are not offered for sale.
- Although authors are permitted to re-use all or portions of the Work in other works, this does not include granting third-party requests for reprinting, republishing, or other types of re-use.

JIM by http://e-journals.unmul.ac.id/index.php/SAKTI/index is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.