Define weak and strong entity sets, Database Management System

Define weak and strong entity sets? 

Weak entity  set:  entity  set  that  do not  have  key  attribute  of  their  own are  known as weak entity sets. 

Strong entity set: Entity set that has a primary key is termed a strong entity set.

 

Posted Date: 7/27/2013 6:53:13 AM | Location : United States







Related Discussions:- Define weak and strong entity sets, Assignment Help, Ask Question on Define weak and strong entity sets, Get Answer, Expert's Help, Define weak and strong entity sets Discussions

Write discussion on Define weak and strong entity sets
Your posts are moderated
Related Questions
2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

What are the several kinds of the update operations on relations? Also explain the constraints on these update operation. Give instance in support of your answer. There are th

Describe association design of an object by giving one suitable example of it. The Design of Associations Associations are "glue" of advanced object oriented analysis and

What are the advantages of having an index structure?      Ans: The index structures commonly provide secondary access paths, which offer alternative ways of accessing the reco

System error :These contain errors in database system or the OS, example, deadlocks.Such errors are fairly hard to detect and need reprogramming the erroneous components of the sys

What are the Requirements of algorithm designer Algorithm designer should: i) Select proper algorithm so as to minimize implementation cost ii) Find most appropriate d

What is a Built-in A notation of identity is built-into the data model or programming language and no user-supplied identifier is needed. This form of identity is used in objec

Natural Join : It is the similar like Equi join except one of the duplicate columns is removed in the result table. The natural join is the most usually used form of join operation

Primary Index In primary index, there is a one-to-one relationship among the entries in the index table and the records in the major table. Primary index can be of two types:

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non