摘要： 将规则库分块是加快规则库匹配的一个重要途径。本文先给出将规则库划分成若干独立子块的划分算法,接着又给出一种允许各子块间有一定相关性的星形分块法。在此基础上,作者提出了准点割集的概念,得到了若干有关定理及星形分块法的修正算法,最后作者还提出了最优星形结构概念,并给出了一个寻找规则库最优星形分块的算法,上述算法提供了由计算机自动对规则库进行划分的方法。

关键词: 规则库, 块状结构, 自动生成

Abstract: An important approach to accelerating matching is to partition rule sets. The algorithm we present divides a rule set into several individual subsets. An optimal algorithm for searching for rule sets is a star-shaped structures which partitions rule sets automatically on the computer.