Many-to-many relationship, Database Management System

Assignment Help:

For each m:n relationship type R, we make a new table (say S) to represent R. We also contain the primary key attributes of both the participating entity types as a foreign key attribute in S. Any easy attributes of the m:n relationship type (or easy components of a composite attribute) is also contain as attributes of S.

For example, the m: n relationship taught-by among entities COURSE and FACULTY should be shown as a new table.  The structure of the table will contain primary key of COURSE and primary key of FACULTY entities

A new table TAUGHT-BY will be created as: Primary key of TAUGHT-By table

 

ID

 

Course_ID

 

{Primary key of FACULTY table}

 

{Primary key of COURSE table}

 

 

Please note that since there are no attributes to this relationship, thus no other fields.


Related Discussions:- Many-to-many relationship

Describe the two alternatives for specifying structural, Describe the two a...

Describe the two alternatives for specifying structural constraints on relationship kinds? Relationship kinds have certain constraints in which limit the possible combination o

What are the three classes of sql expression, What are the three classes of...

What are the three classes of SQL expression? SQL expression consists of three clauses:  Select  From  Where

Which is another name for weak entity, Which is another name for weak entit...

Which is another name for weak entity? Child is another name of weak entity.

Write a qbe query to display names of cs department, Consider a table stude...

Consider a table student (std_id, std_name, date_of_birth, percent_marks, dept_name). Write a QBE query to display names of Computer Science department students who have scored mo

Define control files, Control Files : The redo and control files logs supp...

Control Files : The redo and control files logs support the rest of the architecture. Every database must have at least one control file, although you have more than one to guard

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Database schema, #Use the following database schema: 1) Patient—PatientID, ...

#Use the following database schema: 1) Patient—PatientID, Name, DOB 2) Doctor—DoctorID, Name, MedLicenseNumber, Phone 3) Medication—MedicationID, BrandName, GenericName 4) Prescrip

Define normalization, Normalization :It is a process of examine the given ...

Normalization :It is a process of examine the given relation schemas based on their primary key and Functional Dependencies (FDs) to achieve the properties Minimizing redun

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

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