Fixed points in relational algebra

Authors

  • S. Leonesi
  • S. Tulipani

DOI:

https://doi.org/10.1285/i15900932v18n2p191

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.

Downloads

Published

01-01-1998

Issue

Volume 18, Issue 2 (1998)

Section

Articoli

License

Authors who publish with this publication accept all the terms and conditions of the Creative Commons license at the link below.

Gli autori che pubblicano in questa rivista accettano i termini e le condizioni specificate nella licenza Creative Commons di cui al link sottostante.

http://creativecommons.org/licenses/by-nc-nd/3.0/it/legalcode