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

ER diegrams, How to draw an ER diagram to a finance companz

How to draw an ER diagram to a finance companz

Write short notes on relational model, Write short notes on relational mode...

Write short notes on relational model   The  relational  model  uses a  collection of  tables  to show  both data  and the relationships between those  data.  The relational mo

State about the advance object design, ADVANCE OBJECT DESIGN Introduct...

ADVANCE OBJECT DESIGN Introduction Analysis is the initial step of the OMT methodology. It is apprehensive with devising a precise, concise, correct and understandable mo

Need database normalization and database analysis, Developer is required to...

Developer is required to do a task including: - Database Normalization - Database Analysis - ERM Diagram Details can be provided and then you can change your bid accord

Define outer union operation of the relational algebra, Define outer union ...

Define outer union operation of the relational algebra. Compute the outer union for the relations R and S given below. Outer Join - If there are any values in one tabl

Relational schema for person, Example: RELATIONAL SCHEMA for PERSON: ...

Example: RELATIONAL SCHEMA for PERSON: PERSON (PERSON_ID: integer, NAME: string, AGE: integer, ADDRESS: String) RELATION INSTANCE In this instance, m = 3 and n = 4

Tuples-attributes , Consider a relation s over the attributes A and B wit...

Consider a relation s over the attributes A and B with the following characteristics: 5,000 tuples with 10 tuples per page A 2-level B+ tree index on attribute

Describe the ways for selecting data structure, Ways for Selecting Data Str...

Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th

Data Analysis, A buyer for a large department store chain must place orders...

A buyer for a large department store chain must place orders with an athletic shoe manufacturer six months prior to the time the shoes will be sold in the department stores. In par

Recovery concepts, recovey techniques based on deferred update and immediat...

recovey techniques based on deferred update and immediate update

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