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 the query optimisation, Define the Query optimisation The query ...

Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica

Why do so various organizations use mysql, Why do so various organizations ...

Why do so various organizations use MySQL? Advantages: Open source Highly efficient Offers a high scalability in terms of size and connectivity. Highly prote

Which is a valid sql type, Which is a valid SQL type? A valid SQL Shoul...

Which is a valid SQL type? A valid SQL Should be in CHARACTER it is should be NUMERIC and FLOAT.

Relationship, What is multiple relationship ?

What is multiple relationship ?

Describe specialsation and generalization, Describe Specialsation and gener...

Describe Specialsation and generalization? Specialisation /generalization: This is a top down and bottom up approach to the design of database. It displays the IS_A relation

Remove all transitive dependencies - dependency diagram, 1. Use the Invoice...

1. Use the Invoice table structure shown below to answer the following questions: a)  Draw the dependency diagram and identify the primary key and all dependencies, including al

Key constraint - relational constraints, This constraint shows that the key...

This constraint shows that the key attribute value in each tuple must be unique, i.e., no two tuples have the similar value for the key attribute. This is because the value of the

Insulation between conceptual and physical structures, Insulation between c...

Insulation between conceptual and physical structures It can be defined as: 1. The Database Administrator should be capable to vary the storage structures without affectin

What is called as recursive partitioning, What is called as recursive parti...

What is called as recursive partitioning? The system repeats the splitting of the input unless each partition of the build input fits in the memory. Such partitioning is known

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