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

Normalization database, I need some help with my normalization database hom...

I need some help with my normalization database homework.

Data definition language, Data Definition Language It organises the dat...

Data Definition Language It organises the data in the form of columns and rows. But what does the data field column of table accumulate? How do you describe it using SQL? Th

Database ass1, #quCreate a database design specification (Enhanced Entity R...

#quCreate a database design specification (Enhanced Entity Relationship Diagram (EERD) and Relational Data Model (RDM)) from the given business description. The RDM must be in 3rd

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

Define check point and its impact on data base recovery, Define check point...

Define check point and its impact on data base recovery.                  Ans:  There could be hundreds of transactions handled per minute, in a large on-line database system.

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

Insert - referential integrity, The insertion of a tuple in the aim of refe...

The insertion of a tuple in the aim of reference does not cause any destruction. Though, insertion of a tuple in the relation in which, we has the foreign key, for instance, in ASS

Descrine an data dictionary, Describe an data dictionary? A data dictio...

Describe an data dictionary? A data dictionary is a data structure which keeps meta data about the structure of the database ie. the schema of the database.

Compare the efficiency of the two mining processes, Consider the following ...

Consider the following database containing five transactions. Let min_sup = 60%. Mine all frequent itemsets using Apriori and FP-growth algorithm. Compare the efficiency of the t

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

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