Skip to main content
Article thumbnail
Location of Repository

Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies

By Mark Levene and George Loizou

Abstract

Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. A given set of FDs does not interact with a given set of INDs if logical implication of any FD can be determined solely by the given set of FDs, and logical implication of any IND can be determined solely by the given set of INDs. The set of tree-like INDs constitutes a useful subclass of INDs whose implication problem is polynomial time decidable. We exhibit a necessary and sufficient condition for a set of FDs and tree-like INDs not to interact; this condition can be tested in polynomial time

Topics: csis
Publisher: Elsevier
Year: 2001
OAI identifier: oai:eprints.bbk.ac.uk.oai2:194

Suggested articles

Citations

  1. (1999). A Guided Tour of Relational Databases and Beyond. doi
  2. (1991). Abstraction in query processing. doi
  3. (1988). aih¨ a. Generating Armstrong databases for sets of functional and inclusion dependencies.
  4. (1979). Computational problems related to the design of normal form relational schemas. doi
  5. (1986). Functional and inclusion dependencies: A graph theoretic approach. doi
  6. (1988). Generating Armstrong databases for sets of functional and inclusion dependencies.
  7. (1999). How to prevent interaction of functional and inclusion dependencies. Information Processing Letters, doi
  8. (1984). Inclusion dependencies and their interaction with functional dependencies. doi
  9. (2000). Justification for inclusion dependency normal form. doi
  10. (1986). Referential integrity. In Relational Database: Selected Writings,
  11. (1984). Testing containment of conjunctive queries under functional and inclusion dependencies. doi
  12. (1992). The Design of Relational Databases.
  13. (1985). The implication problem for functional and inclusion dependencies is undecidable. doi
  14. (1983). The implication problem for functional and inclusion dependencies. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.