Penerapan Algoritma Knuth-Morris-Pratt Dalam Sistem Jasa Konsultan berbasis Mobile dan Web

Kristian Telaumbanua, F. Damanik, M. Ilhami, Erlanie Sufarnap
{"title":"Penerapan Algoritma Knuth-Morris-Pratt Dalam Sistem Jasa Konsultan berbasis Mobile dan Web","authors":"Kristian Telaumbanua, F. Damanik, M. Ilhami, Erlanie Sufarnap","doi":"10.47065/josh.v4i2.2981","DOIUrl":null,"url":null,"abstract":"With the increasing of human life aspects, various applications for online consulting service providers have emerged with different fields and backgrounds. To assist the process of selecting consultants according to the preferences of certain users, a consultant search system that covers several consulting areas at once is implemented, which aims to make it easier for users to find consultants that suit their needs. Knuth-Morris-Pratt is a string matching algorithm whose search is based on text and patterns, KMP is used to find where a pattern is found in a collection of other strings with a larger size, this algorithm is also include as one of the fastest and has a small complexity. In this final project, an overview of the application and feature testing using black-box testing will be presented, along with a comparison of the Knuth-Morris-Pratt search algorithm with other search algorithms. The system development methodology used is the waterfall methodology. The results of this final project can be concluded that the application of the Knuth-Morris-Pratt algorithm on mobile and web-based consulting services search applications can assist clients in providing better and more efficient searches.","PeriodicalId":233506,"journal":{"name":"Journal of Information System Research (JOSH)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information System Research (JOSH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47065/josh.v4i2.2981","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the increasing of human life aspects, various applications for online consulting service providers have emerged with different fields and backgrounds. To assist the process of selecting consultants according to the preferences of certain users, a consultant search system that covers several consulting areas at once is implemented, which aims to make it easier for users to find consultants that suit their needs. Knuth-Morris-Pratt is a string matching algorithm whose search is based on text and patterns, KMP is used to find where a pattern is found in a collection of other strings with a larger size, this algorithm is also include as one of the fastest and has a small complexity. In this final project, an overview of the application and feature testing using black-box testing will be presented, along with a comparison of the Knuth-Morris-Pratt search algorithm with other search algorithms. The system development methodology used is the waterfall methodology. The results of this final project can be concluded that the application of the Knuth-Morris-Pratt algorithm on mobile and web-based consulting services search applications can assist clients in providing better and more efficient searches.
克努斯-莫里斯-普拉特算法在以移动和Web为基础的咨询服务系统中的应用
随着人类生活方方面面的不断增加,网络咨询服务商的各种应用也应运而生,其领域和背景各不相同。为了协助根据某些用户的喜好选择顾问的过程,执行了一个同时涵盖若干咨询领域的顾问搜索系统,其目的是使用户更容易找到适合其需要的顾问。Knuth-Morris-Pratt是一种基于文本和模式进行搜索的字符串匹配算法,KMP用于查找在其他较大大小的字符串集合中找到模式的位置,该算法也被认为是最快的算法之一,并且具有较小的复杂性。在这个最终项目中,将概述使用黑盒测试的应用程序和功能测试,并将Knuth-Morris-Pratt搜索算法与其他搜索算法进行比较。使用的系统开发方法是瀑布方法。这个最终项目的结果可以得出结论,将Knuth-Morris-Pratt算法应用于移动和基于web的咨询服务搜索应用程序可以帮助客户提供更好,更高效的搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信