Inclusion dependencies and their interaction with functional dependencies

  • Authors:
  • Marco A. Casanova;Ronald Fagin;Christos H. Papadimitriou

  • Affiliations:
  • Pontificia Universidade Catolica do Rio de Janeiro, Rio de Janeiro, RJ, Brazil;IBM Research Laboratory, San Jose, California;Lab. for Computer Science, M.I.T., Cambridge, Massachusetts

  • Venue:
  • PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inclusion dependencies, or INDs (which can say, for example, that every manager is an employee) are studied, including their interaction with functional dependencies, or FDs. A simple complete axiomatization for INDs is presented, and the decision problem for INDs is shown to be PSPACE-complete. (The decision problem for INDs is the problem of determining whether or not Σ logically implies σ, given a set Σ of INDs and a single IND σ). It is shown that finite implication (implication over databases with a finite number of tuples) is the same as unrestricted implications for INDs, although finite implication and unrestricted implication are distinct for FDs and INDs taken together. It is shown that, although there are simple complete axiomatizations for FDs alone and for INDs alone, there is no complete axiomatization for FDs and INDs taken together, in which every rule is k-ary for some fixed k (and in particular, there is no finite complete axiomatization.) This is true whether we consider finite implication or unrestricted implication, and is true even if no relation scheme has more than three attributes. The nonexistence of a k-ary complete axiomatization for FDs and INDs taken together is proven by giving a condition which is necessary and sufficient in general for the existence of a k-ary complete axiomatization.