Explain weak and strong entity type, Database Management System

Assignment Help:

Explain weak and strong entity type ?

Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a weak entity set depends on the existence of a strong entity set; it must associate to the strong set via a on-to-many relationship set. A discriminator of a weak entity set is the set of attributes that distinguishes between all the entities of a weak entity set. The primary key of a weak entity set is formed by the primary key of the strong entity set on that the weak entity set is existence depends, plus the weak entity set's discriminator.


Related Discussions:- Explain weak and strong entity type

Relational schema, crete a data base relationship model Entity: ...

crete a data base relationship model Entity: Students; Professors; Dormitories buildings; Attributes of students: Name; Address; Dorm;

What is meant by heuristic optimisation, What is meant by heuristic optimis...

What is meant by heuristic optimisation?  Discuss the main heuristics that are applied during query optimisation.  Ans:  In heuristic optimization, heuristics are employed to r

Architectural standard, Architectural standard: Designation : Archit...

Architectural standard: Designation : Architect , Consultant Job Profile : As a part of Oracle Fusion Middleware at Satyam, I am involved with Presales, Delivery, A

What is an index, What is an index? An index is a structure that helps ...

What is an index? An index is a structure that helps to place desired records of a relation quickly, without probing all records.

Apriori algorithm-find all frequent large itemsets, Your friend owns a comp...

Your friend owns a computer store in Yuen Long, selling Desktop and Notebook PCs and other computer peripherals. Having been rather successful with his business there, he decided t

Describe identifying relationship, Describe identifying relationship? ...

Describe identifying relationship? Identifying relationship: It is relationship among strong entity and a weak entity it is represented through a doubly outlined diamond in C

Explain deadlock detection and recovery, Explain Deadlock detection and rec...

Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of a

Explain strict two-phase locking, Explain Strict Two-Phase locking A tr...

Explain Strict Two-Phase locking A transaction T does not release any type of its exclusive (X) locks until that transaction commits or aborts. In this method no other transact

Implementing a data mining algorithm, i need to implememnt a treee based mi...

i need to implememnt a treee based mining algorithm. do you have an expert that can do that?

Database, i would like to ask if you will do assignment of database number ...

i would like to ask if you will do assignment of database number of words 1500 and how much

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