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

Linear commit protocol, With the linear commit protocol, sites are connecte...

With the linear commit protocol, sites are connected in a chain, and the subtransaction at the left-hand end of the chain initiates the protocol. Propose a crash recovery protocol

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

Use the relational algebra to formulate query, Consider the following datab...

Consider the following database schema: STAFF(StaffNo, fName, lName, Position, sex, dob, branchNo) BRANCH(BranchNo, Street, City) Assume the following for the above database

Relational constraints, Relational and E-R Model There are three types o...

Relational and E-R Model There are three types of constraints on relational database that have: DOMAIN CONSTRAINT PRIMARY KEY CONSTRAINT INTEGRITY CONSTRAINT

Failures and recovery, Failures and Recovery In practice various things...

Failures and Recovery In practice various things might occur to prevent a transaction from completing. Recovery methods are used to bring database, which does not satisfy consi

Describe deductive databases and relational databases, Problem : (b) A ...

Problem : (b) A deductive database system is essentially the outcome of applying mathematics logic to database management, where logic is used for both data representation and

Transactions and concurrency management, Transactions And Concurrency Manag...

Transactions And Concurrency Management  Introduction One of the main benefits of storing data in an integrated repository or a database is to permit sharing of it betwee

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