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 thomas write rule, Define Thomas write rule Thomas' write rule: ...

Define Thomas write rule Thomas' write rule: The Thomas' write rule is a modification of timestamp-ordering protocol for concurrency control. Assume that transaction T i issue

What are the overlapping elements, What are the Overlapping elements O...

What are the Overlapping elements Overlapping elements can be found by scanning all the elements in front of deleted element in priority list for the sheet and comparing them

Define multivalued dependency and 4nf, Define multivalued dependency and 4N...

Define multivalued dependency and 4NF.  Ans:  Multivalued Dependency - Assume R be a relation schema and let α ⊆ R and β ⊆ R. The multivalued dependency  α →→β   holds o

Introduction to database technology, 1. Create the tables for the play-sche...

1. Create the tables for the play-scheme database as specified in the TMA. 2. Enter the data as given in the spreadsheet. 3. Create queries to retrieve specified information

Explain interfaces for parametric users, Explain Interfaces for parametric ...

Explain Interfaces for parametric Users? Interfaces for Parametric Users - Parametric users, such as bank tellers, frequent have a little set of operations in which they must p

Enterprise applications integration, The figure below depicts the conceptu...

The figure below depicts the conceptual diagram of a banking system. (a) Describe one example relevant to the system in figure, for each of the 4 types of enterprise appl

Explain candidate key, Explain Candidate key? Candidate Key - A candi...

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

Access, I have to solve a problem using access

I have to solve a problem using access

Prepare a gantt chart for the stock control project, Prepare a gantt chart ...

Prepare a gantt chart for the stock control project: Scenario Lucas-TVS is the Leader in Auto Electricals in India today with 50 years experience in desig

What are the acid properties?, Question 1 What are the advantages of DBMS ...

Question 1 What are the advantages of DBMS approach in managing data? Question 2 What are the services provided by a database system Question 3 List and briefly describe

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