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

Describe the benefits of OOD techniques, Describe the benefits of OOD techn...

Describe the benefits of OOD techniques OOD techniques are very useful for development of large and complex systems. It has been noted that large projects that are developed u

What is theta join explain, What is theta join explain? Theta  Join  -...

What is theta join explain? Theta  Join  - The  theta  join  operation  is  an  extension  to  the  natural-join operation which permits us to merge selection and a Cartesian

State about the advance object design, ADVANCE OBJECT DESIGN Introduct...

ADVANCE OBJECT DESIGN Introduction Analysis is the initial step of the OMT methodology. It is apprehensive with devising a precise, concise, correct and understandable mo

Drop table command, DROP TABLE Command: When an existing object is not ...

DROP TABLE Command: When an existing object is not needed for further use, it is always better to eliminate it from the database. To remove the existing object from the databas

What are metrics for choosing the best algorithm, What are metrics for choo...

What are metrics for choosing the best algorithm? Matrices for choosing the best algorithms are as below: Computational complexity Ease of understand ability and im

Explain relational model and their use in dbms, Explain Relational model an...

Explain Relational model and their use in DBMS? Relational Model - The relational model was first introduced through E.F. Codd of the IBM Research in the year of 1970. The mode

Two types of blocks in the fixed -length representation, What are the two t...

What are the two types of blocks in the fixed -length representation? Define them. Anchor block: Have the first record of a chain. Overflow block: Have the records other tha

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

Relational DB, Suppose R is a relation with attributes A1, A2,..., An. As a...

Suppose R is a relation with attributes A1, A2,..., An. As a function of n, tell how many superkeys R has, if: 1.1 The only key is A1. 1.2 The only key is A1 and A2. 1.3 The o

Define the boyce-codd normal form, Define the Boyce-Codd Normal Form with i...

Define the Boyce-Codd Normal Form with instance and also Compare BCNF and 3NF.  Ans: BCNF: For each functional dependency X->Y in a set F of functional dependencies over relati

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