Weak entity, Database Management System

Assignment Help:

Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by considering some of its attributes in conjunction with the primary key attributes of another entity, which is known as the identifying owner entity.

Usually a partial key is attached to a weak entity type that is used for unique identification of weak entities associated to a particular owner entity type. The following restrictions must hold:

  • The weak entity set and the owner entity set must participate in one to many relationship set. This relationship set is known as the identifying relationship set of the weak entity set.
  • The weak entity set necessary to have total participation in the recognized relationship.

 


Related Discussions:- Weak entity

Write a query to find name from the relational algebra, Consider the relati...

Consider the relations City (city_name, state) Hotel (name, address) City_hotel (hotel_name, city_name, owner) Answer the following queries in relational algebra (i) Find

Identify all renters who have viewed all properties, Consider the subsequen...

Consider the subsequent relations RENTER(rno, fname, lname, address, tel_no, pref_type, max_rent) VIEWING(rno, pno, date, comment) PROPERTY_FOR_RENT( pno, street, area ,city,

Calculate the joint probability, Consider the following frequency counts o...

Consider the following frequency counts of some itemsets in a transaction database r : freq({A}, r) = 0.405 freq({B}, r) = 0.510 freq({C}, r) = 0.303 freq({A

Max. no. of structures in a table or structure, What is the max. no. Of str...

What is the max. no. Of structures that can be included in a table or structure. Nine.

Define the attribute inheritance, Define the Attribute Inheritance The ...

Define the Attribute Inheritance The attributes of a higher level entity set are inherited through a lower level entity set made by specialization-generalization hierarchy. Nam

A b-tree of order how much children m has maximum, A B-tree of order how mu...

A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

Top down method and bottom up method, Evaluate, compare and contrast the tw...

Evaluate, compare and contrast the two methods of relational database design namely top down method and Bottom up method. What will be your choice if you are asked to select a meth

Structure of the ldb, Though all the ABAP/4 Dictionary Structures that exis...

Though all the ABAP/4 Dictionary Structures that exists in the structure of the LDB, being described in Database Program, we are explaining the Dictionary Structures in the Report.

Explain alternate key, Explain Alternate key? Alternate Key - All the...

Explain Alternate key? Alternate Key - All the candidate keys except primary key are known as alternate keys.

Rules of data normalisation, Rules Of Data Normalisation  Let us now su...

Rules Of Data Normalisation  Let us now summarise Normalisation with the help of various clean rules. The following are the necessary rules for the Normalisation process: 1.

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