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

Explain the ansi sparc architecture, Explain the ANSI SPARC architecture ...

Explain the ANSI SPARC architecture The three-schema architecture is as well known as ANSI SPARC architecture. The aim of the three-schema architecture is to separate the user

Normalization, in case of functional dependencies how we get the higher nor...

in case of functional dependencies how we get the higher normal form.

Can a domain, Can a domain, assigned to a data element be changed? Yes....

Can a domain, assigned to a data element be changed? Yes.  We can do so by just overwriting the entry in the field domain.

What is data independence, What is data independence? Data Independenc...

What is data independence? Data Independence: Techniques which permit data to be changed without affecting the applications in which procedure it. There are two types of data

Describe models which define the operations on classes, Describe briefly mo...

Describe briefly models which define the operations on classes. The three models which are used to define operations on classes are as: Object Model = data dictionary + Obje

Explain nonclustered indexes, What is the difference between SQL Server 200...

What is the difference between SQL Server 2000 clustered and nonclustered indexes? With a clustered index, the data are kept in the bottom level of the index and in the similar

Identify the critical activities, Consider a systems development project wi...

Consider a systems development project with the following data Activity                                Duration (weeks)        Precedence Relationship 1. Software design

B-tree, construct a b-tree for the following set of key values 2,3,5,7,11,1...

construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order

Adding redundant associations for efficient access, Adding Redundant Associ...

Adding Redundant Associations for Efficient Access Redundant associations do not add any type of information, therefore during design we should actually examine structure of o

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