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

DBMS, what is specialization?

what is specialization?

Hashing.., various techniques of hashing?

various techniques of hashing?

What is nested relational model, What is nested relational model? The n...

What is nested relational model? The nested relational model is an extension of relational model in which domains might be either atomic or relation valued.

Distributed Database query processing , I am doing research in this area, e...

I am doing research in this area, especially in sime join and join efficacy when several relations have been queried. Relations located in different sites. I need something like n

Define decision tree classifiers, Define decision tree classifiers? As ...

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

Explain the three data anomalies, What are the three data anomalies that ar...

What are the three data anomalies that are similarly to take place as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why n

Define boyce codd normal form, Define Boyce codd normal form A relation...

Define Boyce codd normal form A relation schema R is in BCNF with respect to a set F of functional dependencies if, for all functional dependencies in F + of the form.α ->β.

Describe the term- state diagram, Describe the term- State Diagram Sta...

Describe the term- State Diagram State Diagram: An object could receive a sequence of the input instructions. The state of the object can differ depending upon sequence of in

Explain embedding sql statements, Question 1 Explain the functions of t...

Question 1 Explain the functions of the following Storage Manager Buffer Manager Transaction Manager 2 Discuss about system catalog in a relational DBMS 3

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