Computing covers for embedded functional dependencies
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in O(N2) time
Information Processing Letters
The design of relational databases
The design of relational databases
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Decomposition of a relation scheme into Boyce-Codd Normal Form
ACM '80 Proceedings of the ACM 1980 annual conference
Redundancy, dependencies and normal forms for XML databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Autonomous sets: a method for hypergraph decomposition with applications in database theory
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Lossless decompositions in complex-valued databases
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
The boyce-codd-heath normal form for SQL
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Autonomous sets for the hypergraph of all canonical covers
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending on the set of functional dependencies given, and that the corresponding decision problem is NP-hard. The only algorithm to guarantee both faithfulness and BCNF (if possible) proposed so far in [Os79] is a brute-force approach which always requires exponential time. To be useful in practice, e.g. in automated design tools, we require more efficient means. In this paper we present an algorithm which always finds a faithful BCNF decomposition if one exists, and which is usually efficient, and exponential only in notorious cases.