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

Implementing a distributed database system, A distributed database is defin...

A distributed database is defined as "a collection of multiple logically interrelated database which are physically distributed over a computer network" (a) Give any three advan

What is predictive modelling, Question : (a) Data mining is one of the...

Question : (a) Data mining is one of the best ways to analyse data and using software method, hidden and unexpected patterns and relationships in sets of data can be extracte

What is meant by normalization of data, What is meant by normalization of d...

What is meant by normalization of data? It is a process of examining the given relation schemas based on their Functional Dependencies (FDs) and primary key to achieve the prop

Hashed file organisation, Hashed File Organisation Hashing is the most ...

Hashed File Organisation Hashing is the most common form of purely random access to a database or file. It is also used to access columns that do not have an index as an optimi

Er diagram, Draw an ER diagram for company''s database schema

Draw an ER diagram for company''s database schema

Define normalization, Normalization :It is a process of examine the given ...

Normalization :It is a process of examine the given relation schemas based on their primary key and Functional Dependencies (FDs) to achieve the properties Minimizing redun

Student database, tell me the functionality,advantages and disadvantages of...

tell me the functionality,advantages and disadvantages of student database

Explain concept of inheritance with support of example, Explain concept of ...

Explain concept of inheritance with support of suitable example. Inheritance Inheritance is one of milestone of object-oriented programming language as it allows a creati

Primary index, Primary index A primary index is a file that has a sorte...

Primary index A primary index is a file that has a sorted series of records having two columns: a block address for that key field in the data file; and the ordering key field.

ENTITY DIAGRAMS IN FIRST NORMAL FORM, CAN SOMEONE HELP ME WITH ENTITY DIAGR...

CAN SOMEONE HELP ME WITH ENTITY DIAGRAMS IN FIRST NORMAL FORM?

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