Evaluation of functional linear recursions: A compilation approach

作者:

Highlights:

摘要

A compilation approach is developed for the evaluation of functional linear recursions (linear recursions with function symbols) in deductive databases. A functional linear recursion is transformed to a function-free one by a function-predicate transformation and compiled into a highly regular compiled formula which can be analyzed and evaluated efficiently by the incorporation of finiteness, monotonicity and query constraints. Moreover, a chain-splitting technique is developed for the evaluation of functional linear recursions whose compiled chains consist of infinitely evaluable functions.

论文关键词:Deductive database,linear recursion,functional recursion,integrity constraint,rule compilation,query processing,chain-splitting evaluation

论文评审过程:Received 22 February 1990, Revised 26 February 1991, Available online 17 June 2003.

论文官网地址:https://doi.org/10.1016/0306-4379(91)90034-7