Describes the several relationship constraints, Database Management System

Assignment Help:

Describes the several relationship constraints through giving suitable example?

Constraints on relationships: There are two kinds of constraints on relationships.

1) Mapping cardinalities or cardinality ratios express the number of entities to that another entity can be associated through a relationship set. For a binary relationship set among entities A and B. The mapping cardinality may be any one of the subsequent:

a) One to One: An entity in A is related along with at most one entity in B and an entity in B is related with at most one entity in A.
b) One to Many: An entity in A can be related with any number in B but an entity in B is associated with at most one in A.
c) Many to one: An entity in A is related with at most one in B but an entity in B is associated with any number in A.
d) Many to Many: An entity in A and B can be associated along with any number of entities in the other entity set.

2) Participation constraints: The participation of an entity set E in a relationship set R is said to be total if every entity in E participates within at least one relationship in R. If only a few entities in E participation of entity set E in relationship R is said to be partial.


Related Discussions:- Describes the several relationship constraints

Explain different addressing modes of 8086, 1. Explain different addressing...

1. Explain different addressing modes of 8086 Explanation of all addressing modes 2. Write a sequence of instructions to exchange two register contents using stack

Remove all transitive dependencies - dependency diagram, 1. Use the Invoice...

1. Use the Invoice table structure shown below to answer the following questions: a)  Draw the dependency diagram and identify the primary key and all dependencies, including al

Relational DB, Suppose R is a relation with attributes A1, A2,..., An. As a...

Suppose R is a relation with attributes A1, A2,..., An. As a function of n, tell how many superkeys R has, if: 1.1 The only key is A1. 1.2 The only key is A1 and A2. 1.3 The o

Distributed database management system, Question (a) Differentiate betw...

Question (a) Differentiate between the following terms: (i) Distributed Database v/s Distributed Database management System (ii) Homogeneous Distributed Database v/s Hete

Creating views with read only option-data control, Creating views with Read...

Creating views with Read only option : In the view definition this option is used to make sure that no DML operations can be done on the view.

Find a 3nf decomposition , Find a 3NF decomposition of the following relati...

Find a 3NF decomposition of the following relation scheme: University (Faculty, Dean, Department, Chair, Professor, Rank, Student}. The University relation satisfies the following

DSS, WHAT IS DSS? WRITE ITS REQUIREMENTS.

WHAT IS DSS? WRITE ITS REQUIREMENTS.

Define the categories of sql statements, Define the categories of SQL State...

Define the categories of SQL Statements? 1) Statements that don't return a result set. This statement class includes INSERT, DELETE, and UPDATE. 2)Statements that return

Describe all integrity constraints which are violated, Consider the two rel...

Consider the two relations given below Given that A is the primary key of R, D is the primary key of S and there is a referential integrity among S.A and R.A, discuss all

Relationship for college database, Using the concepts defined previous, we ...

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

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