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

State in detail about data flow diagram, What is a Data Flow Diagram?  ...

What is a Data Flow Diagram?  Data Flow Diagram: A data flow diagram is the graph that shows flow of data values from their sources in objects in the course of processes whic

State the objectives-data source, You will be analysing a set of financial ...

You will be analysing a set of financial data of your choice. It is not necessary to collect any primary data of your own, and publicly available secondary data will be sufficient

Which sorting technique is used to sort databases, Which sorting technique ...

Which sorting technique is used to sort databases, whose sizes are very big?  Give one such algorithm.  Why do sorting techniques like quicksort, insertion sort, etc.  not applied

Explain generalization and aggregation in e_r diagram, Explain the concept ...

Explain the concept of generalization and aggregation in E_R diagrams. Give one example for each one of them? Generalization: Consider extending the entity set account throug

3NF Normalization, Need 2 projects completed in 3NF format.

Need 2 projects completed in 3NF format.

What are the desirable properties of a decomposition, Define What are the d...

Define What are the desirable properties of a decomposition Ans: What are the desirable properties of decomposition - dependency preserving.  Because Lossless join and dependen

Database schemas and dependencies, 1. Staff(staffID, firstName, lastName, a...

1. Staff(staffID, firstName, lastName, availabilityID, experience, phone, mobile, email); 2. Availability(availabilityID, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday,

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

Explain hash file organization, Explain hash file organization? Hash fu...

Explain hash file organization? Hash functions a) The distribution is uniform Hash functions assign each bucket the similar number of search -key values from the set of a

Transaction, what are the states of transaction?

what are the states of transaction?

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