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 are segments in oracle, What are segments in oracle? Segments - Ea...

What are segments in oracle? Segments - Each table has single field of disk space, known as segment, set aside for it in the tablespace. Segments consist of contiguous sections

Produce a logical database design for pharma, Using a database design appro...

Using a database design approach of your choice, produce a logical design for Pharma. 1) Your answer must consist of ONE the following: An entity-relationship (ER) diagra

Explain the management of data store, Explain the Management of Data Store ...

Explain the Management of Data Store Every system irrespective of its nature of application requires storing permanent data for consequent use in problem solving. Some objects

The extract statement do in extract datasets, What does the extract stateme...

What does the extract statement do in extract datasets? The data is written to virtual memory by extract commands.

Database, How many physical thing?

How many physical thing?

#, How to use Oracle

How to use Oracle

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

Employee elation with information, Consider a database application that dea...

Consider a database application that deals with an Employee relation with information such as SIN, name, data of birth (DOB), and DID (the ID of the department at which the employe

Discuss the method for a hash file to expand shrink dynamic, Discuss the me...

Discuss the methods for a hash file to expand and shrink dynamically. What are the advantages and disadvantages of each? The hashing methods that permit dyanamic file expansi

Explain the functions of data manager, Explain the functions of data manage...

Explain the functions of data manager? Functions of Data Manager : - Convert operations in user's queries coming directly through query processor or indirectly in an applicatio

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