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

Define hot swapping, Define hot swapping? Hot swapping permits the remo...

Define hot swapping? Hot swapping permits the removal of faulty disks and changes it by new ones without turning power off. Hot swapping decreases the mean time to repair.

What is oracle databse structure, What is Oracle databse structure? Or...

What is Oracle databse structure? Oracle database structure: The relational model has three main aspects: Structures: Structures are well-defined objects which store th

One-to-many relationship, For each 1: n relationship type R involving two e...

For each 1: n relationship type R involving two entities E1 and E2, we recognize the entity type (say E1) at the n-side of the relationship type R and contain primary key of the en

Implementing a data mining algorithm, i need to implememnt a treee based mi...

i need to implememnt a treee based mining algorithm. do you have an expert that can do that?

Analyzing association traversal, Analyzing Association Traversal Assoc...

Analyzing Association Traversal Association Traversal shall be understood properly for the association design explanation.  Analyzing association traversal means analyzing tra

Explain the concept of deadlock, Explain the concept of deadlock Yes. I...

Explain the concept of deadlock Yes. It can direct to deadlock. Suppose that a batch of frames arrived correctly and were accepted. Then receiver will advance its window. Now s

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

Fundamental operations that are regular to mysql programs, What are the thr...

What are the three fundamental operations that are regular to MySQL Programs? a) Establishing a connection to the MySQL server b) Choosing a database. c) Disconnecting fr

#normalisation.., define normalisation and functional dependency

define normalisation and functional dependency

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