The Community for Technology Leaders
Green Image
Issue No. 04 - April (2006 vol. 18)
ISSN: 1041-4347
pp: 433-447
Wenke Lee , IEEE Computer Society
q{\hbox{-}}\rm gram matching is used for approximate substring matching problems in a wide range of application areas, including intrusion detection. In this paper, we present a tree-based model to perform fast linear time q{\hbox{-}}{\rm gram} matching. All q{\hbox{-}}{\rm grams} present in the text are stored in a tree structure similar to Trie. We use a tree redundancy pruning algorithm to reduce the size of the tree without losing any information. We also use suffix links for fast q{\hbox{-}}{\rm gram} search during query matching. We compare our work with the Rabin-Karp-based hash-table technique, commonly used for multiple q{\hbox{-}}{\rm gram} search. We present results of experiments on system call sequence data used for intrusion detection.
Intrusion detection, q{\hbox{-}}{\rm gram} matching, pattern matching, search problems, string matching, suffix tree, trees, tree data structure, word processing.

W. Lee and P. Fogla, "q-Gram Matching Using Tree Models," in IEEE Transactions on Knowledge & Data Engineering, vol. 18, no. , pp. 433-447, 2006.
81 ms
(Ver 3.3 (11022016))