Relationship cardinality, Database Management System

Assignment Help:

Cardinality shows the number of instances of an entity associated with another entity participating in a relationship. Depend on the cardinality binary relationship can be further dividing into the following categories:

  • One-to-one: An entity in A is related with at most one entity in B, and an entity in B is associated with at most one entity in A.

 

Example: Relationship between university/college and principal

1656_Relationship Cardinality.png

One college only have at the most one principal and one principal can be assigned to only one college.

Likewise we can define the relationship among Vice Chancellor and university.


Related Discussions:- Relationship cardinality

The average amount of their orders , Make SQL statements for the following ...

Make SQL statements for the following scenarios. Your response should contain SQL statement, output and any other assumptions you have made to arrive at the answer. For Colorado cu

Prove that a relation which is 4nf must be bcnf, Prove that a relation whic...

Prove that a relation which is 4NF must be BCNF.   Ans Let R be in 4NF.  Suppose it is not in BCNF.  Hence, there exists an FD X→Y in R such that x is not a super key. Although

What is a candidate key, What is a candidate key? Minimal super keys ar...

What is a candidate key? Minimal super keys are known as candidate keys.

Why are cursors necessary in embedded sql, Why are cursors necessary in emb...

Why are cursors necessary in embedded SQL? A cursor is an object used to store the output of a query for row-by-row processing through the application programs. SQL statements

Explain the relational completeness, Explain the Relational Completeness ...

Explain the Relational Completeness Codd described the term relational completeness to consider to a language that is complete with respect to first-order predicate calculus ex

Describe the ways for selecting data structure, Ways for Selecting Data Str...

Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th

What are the technique to define a schema completely, What are the techniqu...

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

Wound-wait scheme-deadlock prevention, " Wound-wait" scheme : It is based o...

" Wound-wait" scheme : It is based on a preemptive method. It is based on a simple rule:                   If Ti requests a database resource that is held by Tj

What is foreign key, What is foreign key? A relation schema r1 derived ...

What is foreign key? A relation schema r1 derived from an ER schema may contain among its attributes the primary key of another relation schema r2.this attribute is known as a

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