摘要： 递归查询处理是近年来数据库界普遍关心的问题。本文针对数据库递归查询计算问题的一个子类——线性递归查询计算问题进行了讨论。本文首先证明了线性递归系统都是由所谓独立规则组成的。然后分析了现有的几种算法,提出了这类问题的一个更加有效的算法,使得算法在重复计算量、选择条件使用、连接运算次数等几个方面都有所改进。提高了这类问题的计算效率。

Abstract: The recursive query processing is, recently, a generally interested problem in database system field. The linear recursive query computation problem is a subset of database recursive query computation problem. The paper proves that linear recursive system consists of independent rules, analyses several algorithms and proposes a more effective one to improve computation repetition, selective condition usage and consecutive computation frequency, and hence raises computation efficiency.