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

single products ordered, For Colorado customers calculate the number of si...

For Colorado customers calculate the number of single products ordered. If a product is purchased on multiple orders, it should be counted only single time. The result should conta

Define the notation for classes and atrributes, Define the notation for cla...

Define the notation for classes and atrributes The notation for class, attribute, and operations are shown below:     Figure: Class with attributes and operations A

Ordering of tuples, In a relation, tuples are not inserted in any definite ...

In a relation, tuples are not inserted in any definite order. Ordering of tuples is not defined as a part of a relation definition. Though, records may be structured later accordin

Weak entity, Entity types that do not have any key attribute, and therefore...

Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by

Explain naivebayessimple algorithem, Use the IRIS dataset that comes with W...

Use the IRIS dataset that comes with Weka to compare the classification performance of the following algorithms. 1. NaiveBayesSimple 2. MultiLayerPerceptron J48 (

Normalization, Process of normalization is the integral part of designing a...

Process of normalization is the integral part of designing a database. Justify this statement with suitable database design

Which is a valid sql type, Which is a valid SQL type? A valid SQL Shoul...

Which is a valid SQL type? A valid SQL Should be in CHARACTER it is should be NUMERIC and FLOAT.

One to many - relationship cardinality, One-to-many : An entity in A is rel...

One-to-many : An entity in A is related with any number of entities in B. An entity in B is related with at the most one entity in A. Example: Relationship between faculty and d

HYRISE, how to implement hyrise in C plus plus

how to implement hyrise in C plus plus

Which sorting technique is used to sort databases, Which sorting technique ...

Which sorting technique is used to sort databases, whose sizes are very big?  Give one such algorithm.  Why do sorting techniques like quicksort, insertion sort, etc.  not applied

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