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 language | English |
|---|---|
| Pages (from-to) | 43-60 |
| Number of pages | 18 |
| Journal | Information Sciences |
| Volume | 41 |
| Issue number | 1 |
| DOIs | |
| State | Published - 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
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS