Define weak and strong entity sets, Database Management System

Assignment Help:

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 term a strong entity set.

 


Related Discussions:- Define weak and strong entity sets

Serialisability, Serialisability: Any schedule that makes the similar resul...

Serialisability: Any schedule that makes the similar results as a serial schedule is known as a serialisable schedule. But how can a schedule are determined to be serialisable or n

The average amount of their orders , Make SQL statements for the following ...

Make SQL statements for the following scenarios. Your response should contain SQL statement, output and any other assumptions you have made to arrive at the answer. For Colorado cu

Which method is used to key transformation, Which method is used to key tra...

Which method is used to key transformation ? A hash method is used to key transformation.

Explain how you can define an object model of a system, Explain how you can...

Explain how you can define an object model of a system. A list of terms that shall be used by end users to describe state and behaviour of objects in system.   Different use

Explain the aggregation implies concurrency, Explain the Aggregation implie...

Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen

Fragmentation, let us consider a table having 2200 records and the fixed si...

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

Hashed file organisation, Hashed File Organisation Hashing is the most ...

Hashed File Organisation Hashing is the most common form of purely random access to a database or file. It is also used to access columns that do not have an index as an optimi

DBMS, what is specialization?

what is specialization?

Differences among the candidate keys and the primary key, Discuss the diffe...

Discuss the differences among the candidate keys and the primary key of a relation. Give instance to describe your answer? A candidate key is one that can be used as primary ke

Compute the closure set, Compute the closure (F+) for the following set of ...

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

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