Fixed points in relational algebra

Abstract

The relational algebra system for queries on database is surveyed. By the use of partial isomorphisms the limited expressive power of this formalism is established. Then, the fixed point operation is added to build new relations as solutions of particular systems of formulas. Moreover, the search for solutions is related to the usual logic programming machinery.