The design of relational databases
The design of relational databases
A note on relation schemes which are in 3NF but not in BCNF
Information Processing Letters
Dependency preserving refinements and the fundamental problem of database design
Data & Knowledge Engineering - Special issue on ER '96
A relational model of data for large shared data banks
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
Normal forms and relational database operators
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Redundancy Elimination and a New Normal Form for Relational Database Design
Selected Papers from a Workshop on Semantics in Databases
Achievements of Relational Database Schema Design Theory Revisited
Selected Papers from a Workshop on Semantics in Databases
Translation Schemes and the Fundamental Problem of Database Design
ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM (JACM)
Redundancy, dependencies and normal forms for XML databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
What does Boyce-Codd normal form do?
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Unacceptable file operations in a relational data base
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
The boyce-codd-heath normal form for SQL
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
Boyce-Codd-Heath introduced criteria for good database design, which can be formulated in terms of FD's only. Classical design decomposes relations iteratively using projections. BCNF can not be always achieved using projections alone. 3NF was introduced as a compromise. In this paper we summarize all the known characterizations of BCNF and formulate a new one. In [MR96], attribute splitting was suggested as a heuristics to achieve BCNF in case projections do not do the job. Here we show how attribute splitting can be used to restructure a database scheme iteratively such that the result will be in BCNF, is information preserving and preserves the functional dependencies.