Explain algorithm of er to relational mapping, Database Management System

Assignment Help:

Explain algorithm of ER To Relational Mapping ?

ER-to-Relational Mapping Algorithm:

1) Step 1: Mapping of regular entity types: For each strong entity type E, form a relation T which involves all the easy attributes of a composite attribute.

2) Step2: Mapping of weak entity types: For each weak entity type W along with owner entity type E, create relation R and involve all easy attributes (or simple components of composite attributes) of W as attributed of R. In addition, involves as foreign key attributes of R, the primary key attribute (s) of relation(s) which correspond to the owner(s) and the partial key of the weak entity type W, if any.

3) Mapping of relationship types: form a relation R, for relationship along with primary keys of participating relations A and B as foreign keys in R. Further to this, any attributes of relationship become an attribute of R also.

4) Mapping of multivalued attributes: For every multilvalued attribute A, form a new relation R. This relation R will involve an attribute corresponding to A, plus primary key attribute K-as a foreign key in R-of the relation which represents the entity category or relationship type that has A as an attribute.


Related Discussions:- Explain algorithm of er to relational mapping

What is a security, What is a security? Securities are claims on financ...

What is a security? Securities are claims on financial assets.  They can be illustrated as "claim checks" which give their owners the right to receive funds in the future.  Sec

What is recovery?, What Is Recovery?  During the life of a transaction, ...

What Is Recovery?  During the life of a transaction, i.e., a after the start of a transaction but before the transaction commits, various changes may be made in a database state

What is hashing file organization, What is hashing file organization? ...

What is hashing file organization? In the hashing file organization, a hash function is computed on some attribute of every record. The result of the hash function specify in

Describe the benefits of OOD techniques, Describe the benefits of OOD techn...

Describe the benefits of OOD techniques OOD techniques are very useful for development of large and complex systems. It has been noted that large projects that are developed u

What is cardinality ratio, What is Cardinality Ratio? Cardinality Rati...

What is Cardinality Ratio? Cardinality Ratios - The cardinality ratios for relationship kinds specifies the maximum number of relationship instances in which an entity can pa

Availability-data replication, Availability: A site having the copy of a r...

Availability: A site having the copy of a replicated relation fails, even then the relation may be found in another site. Therefore, the system may carry on to process at least th

Generalization and specialization, design a generalization specialization h...

design a generalization specialization hierarchy for a motor vehicle sales company. the company sells motorcycles, passenger cars, vens and buses.

Describe the algorithm to draw the dependency graph, Describe the algorithm...

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Describe the concept of aggregation, Aggregation Aggregation is strong...

Aggregation Aggregation is stronger form of association. It represents the "has-a" or "part-of" relationship. An aggregation association depicts a complex object which is comp

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd