Download Now Free registration required
The concept of this paper helps resolve an ER schema into an appropriate relational Data Description Language (herein standard SQL statements) while considering all the inherent complexity of such a schema. The algorithm resolves all the relationships between the concerned entities (even weak ones), their associated keys - primary and foreign, attributes - simple, composite and multivalued and relationships types from binary to n-ary. The algorithm (as implemented in ANSI C) is smart enough to consider the case of cascading weak entities.
- Format: PDF
- Size: 891.7 KB