Reduced MVDs and minimal covers

Authors:
Z. Meral Özsoyoğlu;Li-Yan Yuan
Affiliations:
Computer Engineering and Science Department, Case Western Reserve University, Cleveland, OH;The Center for Advanced Computer Studies, The University of Southwestern Louisiana, Lafayette, LA and Case Western Reserve University
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1987

Citing 13
Cited 3

Unifying functional and multivalued dependencies for relational database design

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
On the design of relational database schemata

ACM Transactions on Database Systems (TODS)
Hierarchical schemata 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)
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model

Journal of the ACM (JACM)
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database

Journal of the ACM (JACM)
On the Equivalence of Database Models

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
A normal form for nested relations

PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Principles of Database Systems

Principles of Database Systems
Real-world MVD's

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Database Decomposition into Fourth Normal Form

VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases

A Comparative Study of Various Nested Normal Forms

IEEE Transactions on Knowledge and Data Engineering
Construction of a Non-redundant Cover for Conditional Independencies

AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Multi-valued dependencies in the presence of lists

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multivalued dependencies (MVDs) are data dependencies that appear frequently in the “real world” and play an important role in designing relational database schemes. Given a set of MVDs to constrain a database scheme, it is desirable to obtain an equivalent set of MVDs that do not have any redundancies. In this paper we define such a set of MVDs, called reduced MVDs, and present an algorithm to obtain reduced MVDs. We also define a minimal cover of a set of MVDs, which is a set of reduced MVDs, and give an efficient method to find such a minimal cover. The significance and properties of reduced MVDs are also discussed in the context of database design (e.g., 4NF decomposition) and conflict-free MVDs.