4NF Decomposition
4NF Decomposition is the problem of decomposing a relation schema into fourth normal form (4NF). A relation schema is in fourth normal form (4NF) if, whenever a nontrivial multivalued dependency holds for , then so does the functiunal dependency for every column name of . 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
- : size of database
- : number of functional dependencies
Related Problems
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