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

Define atomicity and aggregation, Atomicity : Either all functions are lai...

Atomicity : Either all functions are laid out or none are. Users could not have to think about the effect of incomplete operations. DBMS ensures this by undoing the functions

Define deadlock prevention, Define deadlock prevention. Deadlock preven...

Define deadlock prevention. Deadlock prevention is a set of methods for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pre

Designing the fields in the data base, Designing the fields in the data bas...

Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en

Define deadlock term, a. Define the term "deadlock". There are four conditi...

a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.

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

tell me the functionality,advantages and disadvantages of student database

Deletion anomalies-data redundancy, Deletion Anomalies: Loss of important ...

Deletion Anomalies: Loss of important Information: In some cases, useful information may be lost when a tuple is deleted. For instance, if we delete the tuple corresponding to stu

Why like predicate used for, Why Like predicate used for? LIKE predicat...

Why Like predicate used for? LIKE predicate: The LIKE predicate searches for strings in which have a certain pattern.

Distributed transaction atomic-consistent-isolated, A distributed transacti...

A distributed transaction consists of subtransactions that execute at different sites and access local DBMSs at those sites. For example, a distributed transaction that transfers m

HRM, is Chipo carrying his baby

is Chipo carrying his baby

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