A normal form for precisely characterizing redundancy in nested relations
Authors:
Open Access
- 1 March 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 21 (1) , 77-106
Abstract
We give a straightforward definition for redundancy in individual nested relations and define a new normal form that precisely characterizes redundancy for nested relations. We base our definition of redundancy on an arbitrary set of functional and multivalued dependencies, and show that our definition of nested normal form generalizes standard relational normalization theory. In addition, we give a condition that can prevent an unwanted structural anomaly in nested relations, namely, embedded nested relations with at most one tuple. Like other normal forms, our nested normal form can serve as a guide for database design.Keywords
This publication has 7 references indexed in Scilit:
- Extended algebra and calculus for nested relational databasesACM Transactions on Database Systems, 1988
- A new normal form for nested relationsACM Transactions on Database Systems, 1987
- The design of ¬ 1NF relational databases into nested normal form1987
- Non First Normal Form relations: An algebra allowing data restructuringJournal of Computer and System Sciences, 1986
- An integrated approach to logical design of relational database schemesACM Transactions on Database Systems, 1986
- Multivalued dependencies and a new normal form for relational databasesACM Transactions on Database Systems, 1977
- A complete axiomatization for functional and multivalued dependencies in database relations1977