Evaluation of database recursive logic programs as recurrent function series

  • Authors:

  • Georges Gardarin;Christophe de Maindreville

  • Affiliations:

  • SABRB Project, lNRLA & University Paris VI, B.P. 105, 78153 Le Chesnay-Céédex (France);SABRB Project, lNRLA & University Paris VI, B.P. 105, 78153 Le Chesnay-Céédex (France)

  • Venue:
  • SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

The authors introduce a new method to compile queries referencing recursively defined predicates. This method is based on an interpretation of the query and the relations as functions which map one column of a relation to another column. It is shown that a large class of queries with associated recursive rules, including mutually recursive rules, can be computed as the limit of a series of functions. Typical cases of series of functions are given and solved. The solutions lend themselves towards either extended relational algebra or SQL optimized programs to compute the recursive query answers. Examples of applications are given.