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

What is primary key, What is Primary key? Primary Key - Primary key i...

What is Primary key? Primary Key - Primary key is one of the candidate keys which uniquely identifies each row in the relation.

Development of large scale distributed real systems, Question: (a) What...

Question: (a) What are the challenges in the development of Large Scale Distributed Real Systems? (b) What is backward engineering and forward engineering in a design packa

Benefits and drawbacks of heap files, Benefits of heap files 1.   This i...

Benefits of heap files 1.   This is a easy file Organisation method. 2.   Insertion is somehow capable. 3.   Good for bulk-loading data into a table. 4.   Best if file

Mixed fragmentation, Mixed fragmentation: Sometimes, horizontal fragmentati...

Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli

Writing a pl/sql program, Problem 1. Create a PL/SQL program to insert ...

Problem 1. Create a PL/SQL program to insert data into student table and display the details of the student having Reg.No 1010 Writing a PL/SQL program to Insert data

Doppler Effectabase Management , #question. Draw a picture of a moving sour...

#question. Draw a picture of a moving source and the waves surrounding it according to what you observed in this experiment. How does the spacing of the wave-fronts in front of the

Views-data control, Views A view is like a window by which data from ta...

Views A view is like a window by which data from tables can be changed or viewed. The table on which a view is based is known as Base table. The view is stored as a SELECT stat

Define the one-way associations, One-way Associations When an associat...

One-way Associations When an association is traversed only in the one direction, then it is implemented as a pointer i.e.an attribute which contains an object reference. If mu

What are called index-sequential files, What are called index-sequential fi...

What are called index-sequential files? The files that are ordered sequentially with a primary index on the search key are known as index-sequential files

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