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

What is entity in dbms, What is entity in DBMS? Entity: A DBMS entity i...

What is entity in DBMS? Entity: A DBMS entity is either a thing in the modelled world or a drawing element in an ERD.

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)

Logical operators-logical operators, Logical Operators Rules of Preced...

Logical Operators Rules of Precedence: Order evaluated Operator 1 All comparison operators 2

Two phase locking technique, growing phase and shrinking phase are disjoint...

growing phase and shrinking phase are disjoint, why ?

Information system fundamentals, A full discription of the new, a discripti...

A full discription of the new, a discription of its components, and the bebefit it will provide a company. A disscussion of the information usedin the system. A disscussion of any

Define boyce codd normal form, Define Boyce codd normal form A relation...

Define Boyce codd normal form A relation schema R is in BCNF with respect to a set F of functional dependencies if, for all functional dependencies in F + of the form.α ->β.

Define single valued and multivalued attributes, Define single valued and m...

Define single valued and multivalued attributes. Single valued attributes: attributes with a single value for a particular entity are known as single valued attributes. Mult

Domain constraint, Domain Constraint It shows that each attribute in a ...

Domain Constraint It shows that each attribute in a relation has to contain an atomic value only from the corresponding domains. The data types associated with commercial RDBMS

Data control, Identify the need and use of data control through problem sol...

Identify the need and use of data control through problem solving, illustration

Explain query tree represent relational algebra expression, How does a quer...

How does a query tree represent a relational algebra expression?      Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is

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