UMN Knowledge Center

Perbandingan Algoritma Horspool dan Algoritma Zhu-Takaoka dalam Pencarian String Berbasis Desktop

Kusnadi, Adhi (2017) Perbandingan Algoritma Horspool dan Algoritma Zhu-Takaoka dalam Pencarian String Berbasis Desktop. Ultima Computing: Jurnal Sistem Komputer, 9 (1). ISSN 2549-4007

Full text not available from this repository.
Official URL: https://ejournals.umn.ac.id/index.php/SK/article/v...

Abstract

String searching is the search process by using the index to find text that can help in information retrieval systems. Continuing previous research, this study uses an algorithm Horspool and Zhu-Takaoka to find the performance of each of these algorithms in the search for a pattern in the text. So they make a useful desktop-based application to measure performance of both algorithm, particulary the time required to perform string searching process. Using the method of prototyping and Microsoft Visual Studio with C# programming language implementation. Result obtained from this application is the number of words found, and the processing time of each algorithm. From this study, the Horspool algorithm is 19,82845 percent faster in first test with the pattern "swan" in a text file 50 multiples 1000 words and 15.9442 percent in the second trial using text files 70000 words with different pattern than the number of characters Zhu algorithm -Takaoka in the process of searching string.

Item Type: Article
Uncontrolled Keywords: Terms-String searching, Horspool, Zhu-Takaoka, Microsoft Visual Studio, application, processing time
Subjects: 000 Computer Science, Information and General Works
000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming (Algorithm, Programming Language, Applications, Software, Data Security)
Divisions: Fakultas Teknik Informatika > Program Studi Informatika
Depositing User: mr admin umn
Date Deposited: 06 Oct 2021 08:15
Last Modified: 06 Oct 2021 08:15
URI: http://kc.umn.ac.id/id/eprint/18557

Actions (login required)

View Item View Item