Efficient Evaluation of Linear Recursions with Function Sysmbols in Deductive Databases

We study the compilation and efficient evaluation of functional linear recursions in deductive databases and develop a compiled chain-based query evaluation technique. A functional linear recursion is transformed to a function-free one by a function-predicate transformation. It is then compiled to a highly regular chain/bounded form which can be evaluated efficiently by the incorporation of finiteness, monotonicity and query constraints. Compilation greatly facilitates the analysis of functional recursions.