An introduction to database systems: vol. 1 (5th ed.)
An introduction to database systems: vol. 1 (5th ed.)
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks
Communications of the ACM
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
Normal forms and relational database operators
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Remarks on two new theorems of Date and Fagin
ACM SIGMOD Record
Response to “Remarks on two new theorems of Date and Fagin”
ACM SIGMOD Record
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Database design for incomplete relations
ACM Transactions on Database Systems (TODS)
On Normalization of Relations in Relational Databases
Programming and Computing Software
Simple Epistemic Logic for Relational Database
MICAI '02 Proceedings of the Second Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Computing unique canonical covers for simple FDs via transitive reduction
Information Processing Letters
Computing unique canonical covers for simple FDs via transitive reduction
Information Processing Letters
Functional dependency discovery via Bayes net analysis
MAMECTIS/NOLASC/CONTROL/WAMUS'11 Proceedings of the 13th WSEAS international conference on mathematical methods, computational techniques and intelligent systems, and 10th WSEAS international conference on non-linear analysis, non-linear systems and chaos, and 7th WSEAS international conference on dynamical systems and control, and 11th WSEAS international conference on Wavelet analysis and multirate systems: recent researches in computational techniques, non-linear systems and control
Service aggregation using relational operations on interface parameters
ICSOC'06 Proceedings of the 4th international conference on Service-oriented computing
A normal form for preventing redundant tuples in relational databases
Proceedings of the 15th International Conference on Database Theory
Using data samples in validating data models
International Journal of Knowledge Engineering and Soft Data Paradigms
| Hi-index | 0.01 |
A key is simple if it consists of a single attribute. It is shown that if a relation schema is in third normal form and every key is simple, then it is in projection-join normal form (sometimes called fifth normal form), the ultimate normal form with respect to projections and joins. Furthermore, it is shown that if a relation schema is in Boyce-Codd normal form and some key is simple, then it is in fourth normal form (but not necessarily projection-join normal form). These results give the database designer simple sufficient conditions, defined in terms of functional dependencies alone, that guarantee that the schema being designed is automatically in higher normal forms.