Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 463-469 |
| Number of pages | 7 |
| Journal | Information Systems |
| Volume | 16 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1991 |
| Externally published | Yes |
Keywords
- Deductive database
- chain-splitting evaluation
- functional recursion
- integrity constraint
- linear recursion
- query processing
- rule compilation
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture