An improved QS algorithm for pattern matching of bit stream

DOI

10.2991/wartia-16.2016.374How to use a DOI?

Keywords

intrusion Detection, Pattern Matching, Bit Stream, QS Algorithm, Fast-skip

Abstract

On the condition of bit stream, for the reason of simple character sets of target strings and Pattern strings, the probability of appearance of absolutely bad character is very low. The bad character shift is not suited for pattern matching, because of it’s low efficiency. This paper gives the definition of bad string on the base of bad character shift, as well as comes up with bad sting shift. In the improved QS algorithm, the bad character shift is regarded as the trigger condition of bad string shift, and the bad string shift can expand the average skip length of bad character shift. In this way it can make the matching widows skip longer.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhao Tao
AU  - Jianbo Yang
AU  - Peng Liu
PY  - 2016/05
DA  - 2016/05
TI  - An improved QS algorithm for pattern matching of bit stream
BT  - Proceedings of the 2016 2nd Workshop on Advanced Research and Technology in Industry Applications
PB  - Atlantis Press
SP  - 1886
EP  - 1890
SN  - 2352-5401
UR  - https://doi.org/10.2991/wartia-16.2016.374
DO  - 10.2991/wartia-16.2016.374
ID  - Tao2016/05
ER  -