Binary relationships, Database Management System

Assignment Help:

One-to-one relationship:

For every 1:1 relationship type R in the ER diagram including two entities E1 and E2 we take one of entities (say E1) preferably with total participation and add primary key attribute of one more entity E2 as a foreign key attribute in the table of entity (E1). We will also have all the simple attributes of relationship type R in E1 if any.

For instance, the DEPARTMENT relationship has been extended to contain head-Id and attribute of the relationship. Please note we will maintain information in this table of only present head and Date from which s/he is the head.

There is one Head_of 1:1 relationship among FACULTY and DEPARTMENT. We select DEPARTMENT entity having total participation and add primary key attribute ID of FACULTY entity as a foreign key in DEPARTMENT entity named as Head_ID. Now the DEPARTMENT table will be as follows:

DEPARTMENT

D_NO

D_NAME

Head_ID

Date-from

 

 

 

 

 

 

 

 


Related Discussions:- Binary relationships

Differentiate between b-tree and b+ tree, Differentiate between B-tree and ...

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

Sql, example of embedded SQL query

example of embedded SQL query

What are the various forms of data transparency, What are the various forms...

What are the various forms of data transparency? a) fragmentation transparency b) replication transparency c) location transparency

Determine the advanced modeling concepts, Determine the Advanced modeling c...

Determine the Advanced modeling concepts You have to follow some steps for object-oriented design. These steps for OO Design methodology are as follow:  1)  Produce objec

Example of equijoin, Example: Consider the following relations: ...

Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

Briefly explain the state diagram by taking one example, Briefly explain th...

Briefly explain the state diagram by taking one example. State Diagram - An object can be given a sequence of input instructions. The state of the object can vary depending u

When is a transaction rolled back, When is a transaction rolled back? A...

When is a transaction rolled back? Any changes that the aborted transaction made to the database must be uncompleted. While the changes caused by an aborted transaction have be

Adding redundant associations for efficient access, Adding Redundant Associ...

Adding Redundant Associations for Efficient Access Redundant associations do not add any type of information, therefore during design we should actually examine structure of o

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