4NF Decomposition

4NF Decomposition is the problem of decomposing a relation schema into fourth normal form (4NF). A relation schema RR^* is in fourth normal form (4NF) if, whenever a nontrivial multivalued dependency XYX \rightarrow Y holds for RR^*, then so does the functiunal dependency XAX \rightarrow A for every column name AA of RR^*. Intuitively all dependencies are the result of keys. In particular a 4NF relation schema can have no nontrivial multivalued dependencies that are not functional dependencies.

Parameters

  • nn: size of database
  • kk: number of functional dependencies

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Displaying 8 of 8 other relevant algorithms