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

Calculate the joint probability, Consider the following frequency counts o...

Consider the following frequency counts of some itemsets in a transaction database r : freq({A}, r) = 0.405 freq({B}, r) = 0.510 freq({C}, r) = 0.303 freq({A

Data warehouse, #queDefine a job scheduling strategy that will meet busines...

#queDefine a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pic

Example of database optimisation, Create 1 experiment to demonstrate an asp...

Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment

Define sequence, Define Sequence A sequence is a set of integers 1, 2, ...

Define Sequence A sequence is a set of integers 1, 2, 3 that are generated in order on demand. Sequences are regularly used in databases because lots of applications require ev

Discuss the method for a hash file to expand shrink dynamic, Discuss the me...

Discuss the methods for a hash file to expand and shrink dynamically. What are the advantages and disadvantages of each? The hashing methods that permit dyanamic file expansi

Explain network model in dbms, Explain Network Model in DBMS? Network ...

Explain Network Model in DBMS? Network Model - It was formalised within the late year of 1960s through the Database Task Group of the Conference on Data System Language (DBTG

Describe the algorithm to draw the dependency graph, Describe the algorithm...

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Create a er diagram to show customer accounts, Information about a bank is ...

Information about a bank is about customers and their account. Customer has a name, address that consists of house number, area and city, and one or more phone numbers. Account ha

What you understand by client-server environment, Problem: a) Briefly d...

Problem: a) Briefly describe what you understand by Client-Server environment b) The File Server is a simple form of Client-Server. Describe the principles of the File Serve

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