Fixed points in relational algebra


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.

DOI Code: 10.1285/i15900932v18n2p191

Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia License.