Relationship for college database, Database Management System

Assignment Help:

Using the concepts defined previous, we have identified that strong entities in COLLEGE database are FACULTY, STUDENT, COURSE and DEPARTMENT. This database also has one weak entity known as GUARDIAN. We can states the following relationships:

1. Head-of is a 1:1 relationship among FACULTY and DEPARTMENT.

Participation of the entity FACULTY is partial since not all the faculty members participate in this relationship, as the participation from department side is total, as every department has one head.

2. Works_in, is a 1:N relationship among DEPARTMENT and FACULTY.

Participation from both sides is total.

3. Opts, is a 1:N relationship among COURSE and STUDENT. Participation from student side is total because we are assuming that every student enrolled opts for a course. However the participation from the course side is partial, as there can be courses that no student has opted for.

4. Taught_by, is a M: N relationship between FACULTY and COURSE, as a faculty can teach a lot of courses and a course can be taught by a lot of faculty members.

5. Enrolled, is a 1: N relationship among STUDENT and DEPARTMENT as a student is allowed to enroll for only single department at a time.

6. Has, is a 1:N relationship among STUDENT and GUARDIAN as a student can have more than one local guardian and one local guardian is supposed to be related to one student only. The weak entity Guardian has total participation in the relation "Has".


Related Discussions:- Relationship for college database

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

Determine the statement- state as location within a program, State as Locat...

State as Location within a Program In this traditional approach, location of control inside a program totally defines the program state. Any finite state machine may be implem

Explain dynamic two-phase locking, Explain Dynamic Two-Phase Locking H...

Explain Dynamic Two-Phase Locking Here a transaction locks a data item instantly earlier than any operation is applied on the data item.  After finishing all the operations on

Explain the concept of two-phase locking, Explain the Concept of Two-phase ...

Explain the Concept of Two-phase Locking It concerns the positions of locking and unlocking operations in each transaction.  In this protocol every transaction issue lock and u

Explain the three data anomalies, What are the three data anomalies that ar...

What are the three data anomalies that are similarly to take place as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why n

Cataloguing, differences between a classified catalog and a dictionary cata...

differences between a classified catalog and a dictionary catalog

Define deadlock prevention, Define Deadlock prevention These protocols...

Define Deadlock prevention These protocols make sure that the system will never enter a deadlock state. There are two methods to deadlock prevention. One approach makes sure t

Join operation, The JOIN operation is applied on two relations. When we wan...

The JOIN operation is applied on two relations. When we want to choose related tuples from two given relation join is used. The join operation need that both the joined relations m

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