A DATABASE SCHEMA DESIGN ALGORITHM BASED ON DATA RELATABILITY DEPENDENCIES

摘要

This study describes the data relatability dependency and its properties. Its ability to represent many-to-many relationships exceeds those of functional dependencies and multivalued dependencies. The criterion of complete data relatability is used in determining the merit of a schema that is designed from data relatability dependencies. The degree of control over update anomalies is a major advantage of the data relatability dependency based decomposition. This level of control is higher than those of functional dependency and multivalued dependency based database schema designs.