Enhancement of Rabin-Karp Algorithmusing XOR Filter

Purpose–Thestudy aims to enhance the Rabin-Karp Algorithm that underlinesthe problem encountered wherein the algorithm’s runtimeperformanceis affected due tothe continuous rapid growth of data. Method–Application of XOR Filter in the enhancement of the Rabin-Karp Algorithm is constructed to the given patterns to check for any pattern absences that will be removed from the data input. Then the updated patterns will be utilized in the string-matching process. Results–The modified method displayed significant improvements in different input data sizes and patterns. After conducting runtime tests, it surpasses the improved algorithm using Bloom Filter by 9%, and a rate of 47.53% runtime performance compared to the traditional Rabin-Karp Algorithm. Conclusion–The integration of the XOR Filter into the Rabin-Karp Algorithm, demonstrates a statistically significant runtime improvement. Moreover, itshows an effective scalability with larger datasets, proving its practical suitability for applications or scenarios that handleextensive datasets. Recommendations–Future researchers are encouragedto exploreother alternative techniques and the use of different filtersthat are not mentioned in this study. In addition,it extends future research on the use of Artificial Intelligence to explore diverse strategies and implementation for further improvement of the modified algorithm. Research Implications–Potential directions for further research in string-matching algorithm optimization on effective integration of the XOR Filter into the Rabin-Karp Algorithm. Further highlighting the possibilities of using probabilistic data structures in algorithmic design are observed with the improvements in runtime efficiency. Data processing and pattern-matching areas open the door to effective and scalable solutions by promoting studies in the use of cutting-edge AI techniques to improve current algorithms. Practical Implications–The Enhanced Rabin-Karp Algorithmcan be used by Academic Institutions and Future Researchers to provide a more accurate string-matching process and improved runtime,supporting applications working with massive datasets. Keywords–string matching, probabilistic data structure, bloom filter, pattern, Rabin-Karp, XOR filter