Abstract

This paper describes an algorithmic method for transforming a relational database schema to a binary-relationship one. The source schema may consist of relations that are at any level of normalization, and the designer may add semantic information on the source schema, such as the definition of candidate keys, foreign keys, functional dependencies of various types, multi-valued dependencies, many-to-many constraints, inclusion dependencies, and others. Based on this information, the multi-stage transformation algorithm applies mapping rules to generate object-types, binary-relationships and constraints in the target conceptual schema. The method is implemented as a PC-based tool, utilizing Ingres, SQL and C, and is part of a comprehensive database design tool for both forward and reverse engineering.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call