摘要
介绍了基于树的多关键词快速文本搜索算法,并针对该算法在实际应用中的问题提出了改进措施,在不增加预处理时间和内存空间消耗的前提下有效避免搜索中漏搜和多搜,无损于该算法的高效性。
The tree-based multiple patterns fast match algorithm is introduced and the improvements in its application is given. It effectively avoids the non-disclosure and misrepresent in the text filtering without any increase of the time consumption and the internal memory. The algorithm efficiency is not affected.
出处
《成都信息工程学院学报》
2005年第1期81-83,共3页
Journal of Chengdu University of Information Technology
关键词
基于树的多关键词搜索算法
漏搜
多搜
tree-based multiple patterns match algorithm
non-disclosure
misrepresent