Deductive normal forms of relations
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
Simple conditions for guaranteeing higher normal forms in relational databases
ACM Transactions on Database Systems (TODS)
A corrected 5NF definition for relational database design
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
Minimal lossless decompositions and some normal forms between 4NF and PJ/NF
Information Systems
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
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
Interactive support for non-programmers: The relational and network approaches
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
An Introduction to Database Systems
An Introduction to Database Systems
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM (JACM)
Theory of Relational Databases
Theory of Relational Databases
On the equivalence between FDs in XML and FDs in relations
Acta Informatica
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
| Hi-index | 0.00 |
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and join dependencies. ETNF lies strictly between fourth normal form and fifth normal form (5NF, also known as projection-join normal form). We show that ETNF, although strictly weaker than 5NF, is exactly as effective as 5NF in eliminating redundancy of tuples. Our definition of ETNF is semantic, in that it is defined in terms of tuple redundancy. We give a syntactic characterization of ETNF, which says that a relation schema is in ETNF if and only if it is in Boyce-Codd normal form and some component of every explicitly declared join dependency of the schema is a superkey.