Algorithmic Resolution of an ER Schema into Relational DDL Statements using Artificial Intelligence
|
Full Text(PDF, 3000) PP.
|
|
Author(s) |
Manuj Darbari, Hasan Ahmed, Sunita Bansal |
|
KEYWORDS |
Entity Relationship Schemas, SQL statements, relational tables
|
|
ABSTRACT |
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
|
|
References |
|
[1] Chen, P. 1976. The Entity-Relationship Model--Toward a Unified
View of Data. In: ACM Transactions on Database Systems 1/1/1976
ACM-Press ISSN 0362-5915, S.
[2] Elmasri, Navathe, Somayajulu, Gupta. 2006. Fundamentals of Database
Systems. Pearson Education. ISBN 81-7758-476-6.
[3] CODD, E.F. Normalized data base structure: A brief tutorial. Proc.
ACM-SIGFIDET 1971, Workshop, San Diego, Calif., Nov. 1971, pp. 1-
18.
[4] Codd, E.F. (1990). The Relational Model for Database Management
(Version 2 ed.). Addison Wesley Publishing Company. ISBN 0-201-
14192-2.
|
|
|