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

Describes the several relationship constraints, Describes the several relat...

Describes the several relationship constraints through giving suitable example? Constraints on relationships: There are two kinds of constraints on relationships. 1) Mapping

Implement a cache simulator, You are required to program (in a high level l...

You are required to program (in a high level language such as C, C++, Java) and implement a cache simulator which will have the following inputs and outputs:- INPUTS

ER DIAGRAM, NEED ER DIAGRAM WITH MINIMUM ENTITY AND RELATIONSHIP of Hospita...

NEED ER DIAGRAM WITH MINIMUM ENTITY AND RELATIONSHIP of Hospital Management System

Create a view containing name and number of department, Create a view emp_d...

Create a view emp_dep containing e_name and number of dependents from the tables employee and dependent of (i) CREATE VIEW emp_dept AS SELECT ename, COUNT(*) FROM employee, dep

What are referential integrity constraints, What are referential integrity ...

What are referential integrity constraints? A value that appears in single relation for a given set of attributes also appears for a particular set of attributes in another rel

Creation of indexes, Creation of Indexes Automatically: When a primar...

Creation of Indexes Automatically: When a primary key or Unique constraint is show in a table definition then a unique index is formed automatically. Manually: User can

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

Clinic, Need a sample of a clinic database relationships

Need a sample of a clinic database relationships

Dataware house, ) Define a job scheduling strategy that will meet business ...

) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a picto

Describe substring comparison in sql, Describe substring comparison in SQL....

Describe substring comparison in SQL. For the relation Person (name, address), write a SQL query that retrieves the names of people whose name starts along with ‘A' and address co

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