Decisional Perfect BCNF
Decisional Perfect BCNF is the problem of deciding whether or not a relation schema can be turned into Boyce-Codd normal form (BCNF), without loosing functional dependencies. A relation schema is in Perfect Boyce Codd Normal Form (abbr. perfect BCNF) if all non-trivial FDs in are among the FDs of the normalized form.
Parameters
- : size of database
- : number of functional dependencies
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 1 of 1 algorithms
| See more | ||||
|---|---|---|---|---|
| Liu | 1992 |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table