Skip to main navigation Skip to search Skip to main content

Towards an abstract theory of dependency constraints in relational databases

  • Western University

Research output: Contribution to journal › Article › peer-review

Abstract

We introduce the notion of an FD system on a semilattice as a generalization of the concept of a closed set of functional dependencies, and we study lattice-theoretical properties of those objects. The notion of a table as an abstraction of relations of relational databases is also considered, and a generalization of relational algebra is presented; this offers a better perspective on the role played by Armstrong's relations. Finally, an application of this algebraic approach to dynamic databases is included.

Original languageEnglish
Pages (from-to)43-60
Number of pages18
JournalInformation Sciences
Volume41
Issue number1
DOIs
StatePublished - Feb 1987

ASJC Scopus Subject Areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Towards an abstract theory of dependency constraints in relational databases'. Together they form a unique fingerprint.

Cite this