Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Normalization of relations and PROLOG
Communications of the ACM
Database design for incomplete relations
ACM Transactions on Database Systems (TODS)
Designing Functional Dependencies for XML
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Database Decomposition into Fourth Normal Form
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Reasoning about Uniqueness Constraints in Object Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Improving quality in conceptual modeling
OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.02 |
Decomposition into Boyce-Codd Normal Form (BCNF) with a lossless join and preservation of dependencies is desired in the design of a relational database scheme. However, there may be no decomposition of a relation scheme into BCNF that is dependency preserving, and the known algorithms for lossless join decomposition into BCNF require exponential time and space. In this paper we give an efficient algorithm for lossless join decomposition and show that the problem of deciding whether a relation scheme has a dependency-preserving decomposition into BCNF is NP-hard. The algorithm and the proof assume that all data dependencies are functional. We then discuss the extension of our techniques to the case where data dependencies are multivalued.