Unary inclusion dependencies have polynomial time inference problems

  • Authors:

  • Paris C. Kanellakis;Stavros S. Cosmadakis;Moshe Y. Vardi

  • Affiliations:

  • -;-;-

  • Venue:
  • STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the interaction between unary inclusion dependencies (UIND's) and other known classes of dependencies, in the context of both unrestricted and finite implication. We provide complete axiomatizations for unrestricted and finite implication of UIND's and functional dependencies, and polynomial-time algorithms for the inference problems. The inference problem becomes, however, NP-hard, if we require that some attribute have a bounded domain. We show that for unrestricted implication, the interaction between UIND's and unary functional dependencies completely characterizes the interaction between UIND's and embedded implicational dependencies. Also, for finite implication, the interaction between UIND's and unary functional dependencies completely characterizes the interaction between UIND's and full implicational dependencies (but not UIND's and embedded implicational dependencies).