A normal form for precisely characterizing redundancy in nested relations

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 definit...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on database systems 1996-03, Vol.21 (1), p.77-106
Main Authors: Mok, Wai Yin, Ng, Yiu-Kai, Embley, David W.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Data management systems
Database design and models
Exact sciences and technology
Information systems
Information systems. Data bases
Memory organisation. Data processing
Redundancy
Relational database model
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0362-5915
1557-4644
DOI:10.1145/227604.227612