Development of Intelligent Full-text Search System using Efficient Pattern Matching Algorithms on Compressed Data

从压缩模式匹配的理论角度出发，介绍了一种统一的基于字典的数据压缩方法的框架，称为拼贴系统。我们开发了Knuth-Morris-Pratt型和Boyer-Moore型的拼贴系统模式匹配算法。我们将这些算法用于字节对编码压缩方法，得到了实际中最快的压缩模式匹配算法。拼贴系统还成功地处理了多模式匹配和近似字符串匹配。我们还将该方法应用于另一个有希望的压缩程序Sequitur，并验证了其性能。此外，我们研究了一种高效的完全压缩模式匹配的平衡直线程序，其中不仅文本字符串，而且模式字符串被压缩。我们还开发了一个在线算法，从给定的字符串集合中构造一个子序列自动机，它接受集合中任何字符串的所有连续性。该算法是最快的，我们验证了它是相当有用的加速知识发现系统。另一方面，在数据库知识发现方面，研究了树的实例转换规则的可学习性，以及从大型文本数据库中搜索词的最优关联规则。Journal of Discrete Algorithms，1（1），2000年

From a theoretical point of view on compressed pattern matching, we introduced a unified frame work, called Collage System, for various dictionary-based data compression methods. We developed both Knuth-Morris-Pratt type and Boyer-Moore type pattern matching algorithms for Collage Systems. We adopted these algorithms for Byte-Pair-Encoding compression method, that yields the fastest compressed pattern matching algorithm in practice. Multiple pattern matching and approximate string matching were also successfully dealt with Collage Systems. We also applied the method for Sequitur, that is another hopeful a compression program, and verified its performance. Moreover, we studied an efficient fully compressed pattern matching for balanced straight-line programs, where not only text strings but also pattern strings are compressed. We also developed an online algorithm that constructs a subsequence automaton from given set of strings, that accepts all subsequences of any string in the set. The algorithm is the fastest, and we verified that it is quite useful to accelerate a knowledge discovery system. On the other hand, concerning with knowledge discovery from database, we studied on the learnability of transformation rules of trees from examples, and searching optimal association rules of words from large text databases. Journal of Discrete Algorithms, 1(1), 2000