Abstract
String matching is a fundamental problem in computer science. In order to gain higher performance online exact single pattern string matching algorithms, the authors improved the Skip algorithm which is a comparison based exact single pattern string matching algorithm. By introducing the q-grams method in the sliding window and the comparing window of Skip respectively, the branch prediction failure and the average branch cost are reduced. Meanwhile, the greedy jump method is introduced in Skip. Greedy jump is a common accelerating method for string matching, while there are some waste reads for algorithms with unfixed jump distance. Since Skip has fixed jump distance, greedy jump is more suitable for Skip. Therefore, the authors presented the HGQS algorithm. Experiments results have indicated that HGQS has higher practical performance and it is more efficient in some cases than other known algorithms in many cases on the platform.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762–772 (1977)
Naser, M.A.S., Rashid, N.A., Aboalmaaly, M.F.: Quick-skip search hybrid algorithm for the exact string matching problem. Int. J. Comput. Theory Eng. http://www.ijcte.org/papers/462-G1278.pdf (2012)
Lecroq, T.: Fast exact string matching algorithms. Info. Process. Lett. 102(6), 229–235 (2007)
Peltola, H., Tarhio, J.: Variations of forward-SBNDM. In: 16th Prague Stringology Conference, PSC2011.http://www.stringology.org/event/2011/p02.html (2011)
Faro, S., Lecroq, T.: The exact string matching problem: a comprehensive experimental evaluation. Computing Research Repository. http://arxiv.org/abs/1012.2547 (2010)
Faro, S., Lecroq, T.: The exact online string matching problem: a review of the most recent results. ACM Comput. Surv. http://www-igm.univ-mlv.fr/~lecroq/articles/acmsurv2013.pdf (2013)
Fredriksson, K., Grabowski, S.: Practical and optimal string matching. In: The 12th Symposium on String Processing and Information Retrieval, pp. 376–387. Springer, Berlin (2005)
Durian, B., Peltola, H., Salmela, L et al.: Bit-parallel search algorithms for long patterns. In: LNCS 6049: The 9th International Symposium on Experimental Algorithms, SEA 2010, vol. 2010, pp. 129–140, Springer, Berlin (2010)
Durian, B., Holub, J., Peltola, H et al.: Tuning BNDM with q-grams. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX2009, vol. 2009, pp. 29–37. SIAM, New York (2009)
Faro, S., Lecroq, T.: A fast suffix automata based algorithm for exact online string matching. In: LNCS 7276: The 17th International Conference on Implementation and Application of Automatad (CIAA 2012), vol. 2012, pp. 149–158. Springer, Berlin (2012)
Faro, S., Lecroq, T.: A multiple sliding windows approach to speed up string matching algorithms. In: LNCS 7276: The 11th International Symposium on Experimental Algorithms, SEA2012, vol. 2012, pp. 172–183 (2012)
Faro, S., Lecroq, T.: Efficient variants of the backward-oracle-matching algorithm. Int. J. Found. Comput. Sci. 20(6), 967–984 (2009). doi:10.1142/S0129054109006991
Acknowledgments
This paper is supported by the Yunnan Province Social Development Science and Technology Project of China (NO.2010CA016) and the Innovation Fund for Technology Based Firms of China (NO.10C26215305130). Thanks for the funding.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Wu, W., Fan, H., Liu, L., Huang, Q. (2013). Fast String Matching Algorithm Based on the Skip Algorithm. In: Wong, W.E., Ma, T. (eds) Emerging Technologies for Information Systems, Computing, and Management. Lecture Notes in Electrical Engineering, vol 236. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7010-6_29
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7010-6_29
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7009-0
Online ISBN: 978-1-4614-7010-6
eBook Packages: EngineeringEngineering (R0)