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

How is concurrency identified, How is concurrency identified? Concurren...

How is concurrency identified? Concurrency in objects can be identified by the way they alter their state. Current objects can change their state independently. Aggregation imp

aggregate functions-data manipulation language, Aggregate functions ...

Aggregate functions Some of these functions are min, count, max, and avg. These functions help in getting consolidated information from a set of tuples. Example:

How to insert data in your table from another table, How to Insert data in ...

How to Insert data in your table from another table? insert into e.g, To insert tuples from employee into N_emp created above, use following statement Insert into N_emp

Explain domain-oriented relational calculus?, How does Tuple-oriented relat...

How does Tuple-oriented relational calculus vary from domain-oriented relational calculus? The tuple-oriented calculus uses a tuple variables i.e., variable whose only allowed

Security-data fragmentation, Security: Data not needed by local applicatio...

Security: Data not needed by local applications is not stored at the site, therefore no unnecessary security violations may exist. But how can we carry out fragmentation? Fragm

Attributes, Attributes and its types explain?

Attributes and its types explain?

Related Rates, All edges of a cube are expanding at a rate of 6 centimeters...

All edges of a cube are expanding at a rate of 6 centimeters per second. How fast is the surface area changing when each edge is (a) 2 centimeters and (b) 10 centimeters?

Explain the cascadeless schedule, Explain the Cascadeless Schedule A ca...

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

Data redundancy, Data Redundancy -A lot of information is being repeated in...

Data Redundancy -A lot of information is being repeated in the relation. For instance, the information that MCS-014 is named SSAD is repetitive, address of Rahul is "D- 27, Main ro

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