Abstract:
Searching for data or information has become a necessity in today’s digital era. One type of data search that is often used is string matching or patterns in a text. The ...Show MoreMetadata
Abstract:
Searching for data or information has become a necessity in today’s digital era. One type of data search that is often used is string matching or patterns in a text. The speed of an application in the data search process, especially applications that have many users and large data on a server is a challenge, especially for digital business companies. Internet connection, powerful servers, effective and efficient data search algorithms are some of the determining factors. In general, string matching uses the SQL Query Like method. In this research, a comparison of several algorithm methods that can be used in string search, including Boyer-Moore, Naive String Matching, Knuth-Morris-Pratt and Rabin-Karp Algorithm to find the best algorithm in the data search process. From the tests that have been carried out, the results of the Boyer More algorithms are faster than other algorithms or 45.8% faster based on performance testing with 250,000 data. In the memory usage testing process, the average memory used by SQL is more than other algorithms.
Published in: 2023 17th International Conference on Telecommunication Systems, Services, and Applications (TSSA)
Date of Conference: 12-13 October 2023
Date Added to IEEE Xplore: 25 December 2023
ISBN Information: