A Multiple Patterns Matching Method Based on Added Information

Author

Jun, Lu ; Daxin, Liu ; XuJie, Han

Author_Institution

Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin

fYear

2008

fDate

28-29 Jan. 2008

Firstpage

234

Lastpage

241

Abstract

The multiple patterns matching algorithm based on added information is advanced in this paper. It can overcome language problem in some patterns matching algorithm. To reduce collision, the information of multiple continuous bytes is used in matched text. It adopts AVL tree managing index to reduce average searching times. The algorithm also makes use of specifically character of pattern collection to eliminate more collision. It adapts to matching on bigger pattern collection. This algorithm is easy to be translated into parallel pattern matching algorithm.

Keywords

pattern matching; tree searching; AVL tree managing index; added information; multiple continuous bytes; multiple patterns matching method; parallel pattern matching algorithm; pattern collection; Algorithm design and analysis; Automata; Binary trees; Biology computing; Computer science; Educational institutions; Internet; Natural languages; Pattern analysis; Pattern matching; Collision; Multiple patterns matching; Parallel pattern matching;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Computing in Science and Engineering, 2008. ICICSE '08. International Conference on

Conference_Location

Harbin

Print_ISBN

978-0-7695-3112-0

Electronic_ISBN

978-0-7695-3112-0

Type

conf

DOI

10.1109/ICICSE.2008.56

Filename

4548264