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

Query, Use a Set operator to create a list of academics who have written or...

Use a Set operator to create a list of academics who have written or co-written less than 5 papers and also have greater than 3 interests. List their academic number in the output.

A file manipulation command that extracts some records, A file manipulation...

A file manipulation command that extracts some of the records from a file is called ? A file manipulation command that extracts some of the records from a file is called SELECT

Explain the isa relationship, Explain the ISA relationship Answer: IS...

Explain the ISA relationship Answer: ISA relationship - ISA notation is employed in generalization/ specialization to depict relationship among lower and higer level entity s

What is bankers algorithm, What is banker's algorithm?  Banker's algori...

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty

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

Abap/4 program, It is not possible to make an ABAP/4 program, which having ...

It is not possible to make an ABAP/4 program, which having only Subroutines. False. We can make ABAP/4 program, which having only Subroutines.

Demonstrate the design of associations, Demonstrate the Design of associati...

Demonstrate the Design of associations During object design phase we must design a strategy to implement associations. Association may be unidirectional or bi-directional. Wha

E-R Diagram, The H. I. Topi School of Business operates international busin...

The H. I. Topi School of Business operates international business programs in 10 locations throughout Europe. The school had its first class of graduates in 1965. The school keep

The conceptual level or global level in dbms, The Conceptual Level or Globa...

The Conceptual Level or Global level The conceptual level presents a logical view of the complete database as a unified whole. It permits the user to bring all the data in th

Explain the togaf framework for enterprise architectures, Question: (a)...

Question: (a) With the help of a diagram, explain the TOGAF framework for enterprise architectures. (b) Where would you position enterprise architectures in an enterpri

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