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

An Apriori algorithm, Submission Requirements All answers must be co...

Submission Requirements All answers must be computer generated (including text and diagrams). The hand-in version must include a header page (or with sufficient space)

Descrine an data dictionary, Describe an data dictionary? A data dictio...

Describe an data dictionary? A data dictionary is a data structure which keeps meta data about the structure of the database ie. the schema of the database.

The locking protocol, The Locking Protocol: To manage concurrency related ...

The Locking Protocol: To manage concurrency related problems we use locking. A lock is mainly a variable that is associated with a data item in the database. A lock can be located

Determine the concept of process, Determine the concept of Process Pro...

Determine the concept of Process Process: A process transforms the data values. It is represented as ellipse containing a description of transformation. Each procedure has a

Describe the term- state diagram, Describe the term- State Diagram Sta...

Describe the term- State Diagram State Diagram: An object could receive a sequence of the input instructions. The state of the object can differ depending upon sequence of in

Transaction managenment, can you please explain with the help of suitable e...

can you please explain with the help of suitable example the difference between conflict equivalence and conflict serializability?

Insertion anomaly-data redundancy, Insertion Anomaly: Inability to show ce...

Insertion Anomaly: Inability to show certain information-The primary key of the over relation be (enrolment number, Cno). Any new tuple to be inserted in the relation should have

State the technique of converting the state diagram to code, The technique ...

The technique of converting the state diagram to code a) Identify all major control paths. Start from initial state; choose a path across the diagram that corresponds to normal

What is a select operation, What is a SELECT operation? The select oper...

What is a SELECT operation? The select operation selects tuples that please a given predicate. We use the lowercase letter σ to denote selection.

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