P-complete

Multivalued Dependency (MVD)

Category: Logic

Input

A set $\Sigma$ of multivalued dependencies and a multivalued dependency $\sigma$.

Problem

Does $\Sigma$ imply $\sigma$?

Definitions

Let $U$ denote the set of all attributes in the database and let $X$, $Y$, and $Z$ denote sets of attributes. An embedded multivalued dependency (EMVD) is an expression of the form $X \to\to Y \mid Z$, where $X$, $Y$, and $Z$ are disjoint sets of attributes in which $Y$ and $Z$ nonempty. A multivalued dependency (MVD) is an EMVD in which $Z$ is equal to $U - XY$. A set $\Sigma$ of MVDs implies a MVD $\sigma$ if $\sigma$ holds in every database in which every member of $\Sigma$ holds.

Status

$\P$-complete (Denenberg [1]).

Remarks

The reduction to show hardness is from HORN.

References

  1. L. Denenberg (1984). Computational Complexity of Logical Problems.
  2. Greenlaw, R., Hoover, H. J., and Ruzzo, W. L. (1995). Limits to Parallel Computation: P-Completeness Theory. Oxford University Press. Problem A.6.5.