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)
Normalization and hierarchical dependencies in the relational data model
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)
Independent components of relations
ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks
Communications of the ACM
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Minimum covers in the relational database model (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Normal forms for relational data bases.
Normal forms for relational data bases.
Improving data base integrity based on functional dependencies.
Improving data base integrity based on functional dependencies.
An improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme
IEEE Transactions on Software Engineering
Deduction Graphs: An Algorithm and Applications
IEEE Transactions on Software Engineering
Conjunctive query equivalence of keyed relational schemas (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
A simple guide to five normal forms in relational database theory
Communications of the ACM
Relative information capacity of simple relational database schemata
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
IEEE Transactions on Software Engineering
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Designing Good Semi-Structured Databases and Conceptual Modeling
ER '99 Proceedings of the 18th International Conference on Conceptual Modeling
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Binary equality implication constraints, normal forms and data redundancy
Information Processing Letters
Database-oriented decision support systems
AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
An information-theoretic analysis of worst-case redundancy in database design
ACM Transactions on Database Systems (TODS)
Redundancy detection in service-oriented systems
Proceedings of the 19th international conference on World wide web
| Hi-index | 0.02 |
In this paper, we show that some Codd third normal form relations may contain “superfluous” attributes because the definitions of transitive dependency and prime attribute are inadequate when applied to sets of relations. To correct this, an improved third normal form is defined and an algorithm is given to construct a set of relations from a given set of functional dependencies in such a way that the superfluous attributes are guaranteed to be removed. This new normal form is compared with other existing definitions of third normal form, and the deletion normalization method proposed is shown to subsume the decomposition method of normalization.