使用克努斯-莫里斯-普拉特算法建立了七部圣训系统

Desy Kartika Sari, Dwi Sakethi, Rizky Prabowo
{"title":"使用克努斯-莫里斯-普拉特算法建立了七部圣训系统","authors":"Desy Kartika Sari, Dwi Sakethi, Rizky Prabowo","doi":"10.23960/KOMPUTASI.V7I1.1703","DOIUrl":null,"url":null,"abstract":"Hadith search information system requires the main function that is the word search method to make it easier for users to find the word they are looking for. Word search can be conducted by using string matching algorithm to obtain the search term, one of them is Knuth-Morris-Pratt algorithm. This algorithm has two stages in the search process, namely the pre-KMP process which is the stage of giving a shift value in the keyword (pattern) and KMP-Search stage which is a matching phase between text and keyword (pattern). The process of matching text and patterns is conducted from the left to the right based on the value of the shift that has been obtained in the pre-KMP process. The search time is influenced by the length of the text on the database and the pattern the user is looking for, the longer the text and pattern, the search time will increase.","PeriodicalId":292117,"journal":{"name":"Jurnal Komputasi","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Pengembangan Sistem Pencarian Pada Tujuh Kitab Hadis Menggunakan Algoritma Knuth-Morris-Pratt\",\"authors\":\"Desy Kartika Sari, Dwi Sakethi, Rizky Prabowo\",\"doi\":\"10.23960/KOMPUTASI.V7I1.1703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hadith search information system requires the main function that is the word search method to make it easier for users to find the word they are looking for. Word search can be conducted by using string matching algorithm to obtain the search term, one of them is Knuth-Morris-Pratt algorithm. This algorithm has two stages in the search process, namely the pre-KMP process which is the stage of giving a shift value in the keyword (pattern) and KMP-Search stage which is a matching phase between text and keyword (pattern). The process of matching text and patterns is conducted from the left to the right based on the value of the shift that has been obtained in the pre-KMP process. The search time is influenced by the length of the text on the database and the pattern the user is looking for, the longer the text and pattern, the search time will increase.\",\"PeriodicalId\":292117,\"journal\":{\"name\":\"Jurnal Komputasi\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Komputasi\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23960/KOMPUTASI.V7I1.1703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Komputasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23960/KOMPUTASI.V7I1.1703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

圣训搜索信息系统要求的主要功能是单词搜索方法,使用户更容易找到他们正在寻找的单词。单词搜索可以通过使用字符串匹配算法来获得搜索项,其中一种是Knuth-Morris-Pratt算法。该算法在搜索过程中有两个阶段,即pre-KMP过程,即在关键字(模式)中给出移位值的阶段;KMP-Search阶段,即文本与关键字(模式)之间的匹配阶段。匹配文本和模式的过程是基于在pre-KMP过程中获得的移位值从左到右进行的。搜索时间受数据库上的文本长度和用户所查找的模式的影响,文本和模式越长,搜索时间就会增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Pengembangan Sistem Pencarian Pada Tujuh Kitab Hadis Menggunakan Algoritma Knuth-Morris-Pratt
Hadith search information system requires the main function that is the word search method to make it easier for users to find the word they are looking for. Word search can be conducted by using string matching algorithm to obtain the search term, one of them is Knuth-Morris-Pratt algorithm. This algorithm has two stages in the search process, namely the pre-KMP process which is the stage of giving a shift value in the keyword (pattern) and KMP-Search stage which is a matching phase between text and keyword (pattern). The process of matching text and patterns is conducted from the left to the right based on the value of the shift that has been obtained in the pre-KMP process. The search time is influenced by the length of the text on the database and the pattern the user is looking for, the longer the text and pattern, the search time will increase.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信