Improved multi-keyword matching algorithm

Liu Ling Dai*, Shu Mei Wang, He Yan Huang, Zhao Xiong Chen

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

摘要

An improved algorithm for matching multiple strings is suggested. The new algorithm, named QMS (quick multi-pattern search), is based on the analysis of Sun Wu algorithm and the idea of QS (quick search) algorithm. QMS uses HASH table and PREFIX table to decrease the number of comparisons. During the computation of the shift distance, the character closely after the current window is considered. Thus shift distances are computed with more accurate technique, and larger average shift distance is acquired. The scanning efficiency and the space utility are improved in result. Series of tests on an actual corpus show that QMS algorithm is much more efficient than Sun Wu algorithm under usual circumstances.

源语言英语
页(从-至)735-739
页数5
期刊Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology
29
6
出版状态已出版 - 12月 2005
已对外发布

指纹

探究 'Improved multi-keyword matching algorithm' 的科研主题。它们共同构成独一无二的指纹。

引用此

Dai, L. L., Wang, S. M., Huang, H. Y., & Chen, Z. X. (2005). Improved multi-keyword matching algorithm. Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology, 29(6), 735-739.