Binary equality implication constraints, normal forms and data redundancy

Authors:
Junhu Wang
Affiliations:
School of Information and Communication Technology, Griffith University, Gold Coast, Australia
Venue:
Information Processing Letters
Year:
2007

Citing 9
Cited 0

Data structures and algorithms for disjoint set union problems

ACM Computing Surveys (CSUR)
An introduction to database systems (7th ed.)

An introduction to database systems (7th ed.)
An improved third normal form for relational databases

ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Implication and Referential Constraints: A New Formal Reasoning

IEEE Transactions on Knowledge and Data Engineering
Justification for Inclusion Dependency Normal Form

IEEE Transactions on Knowledge and Data Engineering
Logical Database Design with Inclusion Dependencies

Proceedings of the Eighth International Conference on Data Engineering
Inclusion Dependencies in Database Design

Proceedings of the Second International Conference on Data Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

We define binary equality implication constraints (BEICs) in relational databases and study the implication problem of these constraints, in particular, we provide a sound and complete set of inference rules for a common subset of BEICs. Two normal forms with respect to BEICs are defined and shown to be necessary and sufficient to prevent different types of data redundancies that may be caused by these constraints.