Fast single pattern string matching algorithms based on multi-windows and integer comparison

String matching is a fundamental problem in computer science. It has been widely used in many important fields. In this article, we presented an integer comparison method to improve the branch performance, and we improved an exact single pattern string matching algorithm-TSW by introducing the multi-window method and the integer comparison method. Therefore, we presented a new serial of algorithms named kSWXC (k Sliding Windows with X Comparison, X is the data type for comparison). Experiment results indicated that kSWXC is faster than other known algorithms for short patterns on our platform.