Key, participation and mapping constraints, Database Management System

Assignment Help:

Q. Explain the terms key constraints participation constraints and mapping caradinalities in ER model. 

Participation Constraints :   The participation of an entity set E in the relationship   set R is said to be total if every in E participates in at least one relationship in R. If only some entities in E participate in relationship in R, the participation of entity set E in relationship R is said to be partial. For eg., we expect every loan entity to be related to at least one customer through the borrower relationship. Therefore, the participation of loan in the relationship set borrower is total. In contrast, an individual can be a bank customer whether or not he/she has a loan with the bank. Hence, it is possible that only some of the customer entities are related to the loan entity set through the borrower relationship, and the participation of customer in the borrower relationship set is therefore partial.

Key Constraints: An important constraint on the entities of an entity type is key or uniqueness constraint on attributes. An entity type usually has an attribute whose values are distinct for each individual entity in the collection. Such an attribute is a key of an entity leans that the preceding uniqueness property must hold for every extension of entity type. Hence, it is a constraint that prohibits any two entities from having the same value for the key attribute at the same time. It is a constraint on all extensions of the entity type. Some entity types have more than one key attributes

Mapping constraints: Mapping constraints of mapping cardinalities or cardinality ratio, express the number of entities to which another entity can be associated via a relationship set. Mapping cardinalities are most useful in describing binary relationship sets that involve more than two entity sets. For a binary relationship set R between entities sets A and B the mapping cardinality must be one of the following: One to One: An entity in A is associated with at most one entity in B and an entity in B is associated with at most one entity in A(see figure). One to Mant: An entity in A is associated with any number (Zero to more) of entities in B. An entity in B, however can be associated with at most one entity in A (see figure). Many to One: An entity in A is associated with at most one entity in B. An entity in B, however, can be associated with any number (zero of more) of entity in A (see figure) Many to Many : An entity in A is associated with any number of entities in B, and an entity cardinality for a particular relationship set obviously depends on the real word situation that the relationship set is modeling. As an illustration, consider the borrower relationship set. If in a particular bank a loan can belong to only one customer and customer can have several loans, then the relationship set from customer to loan is one to many. If a loan can belong to several customers the relationship set is many to many. 


Related Discussions:- Key, participation and mapping constraints

What are axioms, What are axioms? Axioms or rules of inference give a s...

What are axioms? Axioms or rules of inference give a simpler technique for reasoning about

ERD, A student entity type has the following attributes,name..

A student entity type has the following attributes,name..

What is gathering information and producing erd, What is Gathering informat...

What is Gathering information and Producing ERD Gathering information: This could be a written document that explains the system in question with reasonable quantity of detai

What are the uses of the information in the data dictionary, What are the u...

What are the uses of the information in the Data dictionary? The following information is directly taken from the Data dictionary: Information on fields displayed with

Case-based online phone repair, please i request for your assistance in de...

please i request for your assistance in developing a case-based online phone repair

Column constraints-on delete cascade, CREATE TABLE prodtrans ( pno ...

CREATE TABLE prodtrans ( pno number (4) ptype char (1) CHECK (ptype in ('I','R','S')), qty number (5) FOREIGN KEY pno REFERENCES product (pno) ON DELETE CASCADE);

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

ER diagram, #question. acompani datdbase needs to store information about e...

#question. acompani datdbase needs to store information about employees (identified by a social security number,with salary and phone as attributes) and departments (identified 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 (

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