Strong entity set and weak entity set, Database Management System

Assignment Help:

Strong entity set and weak entity set?

Strong entity set and weak entity set: A strong entity set has a primary key. All tuples in the set are distinguishable through that key. A weak entity set has no primary key unless attributes of the strong entity set on that it depends are involved. Tuples in a weak entity set are partitioned according to their relationship along with tuples within a strong entity set. Tuples within each partition are distinguishable through a discriminator that is a set of attributes. A strong entity set has a primary key. All tuples in the set are distinguishable through that key. A weak entity set has no primary key unless attributes of the strong entity set on that it depends are included. Tuples in a weak entity set are partitioned according to their relationship along with tuples in a strong entity set. Tuples within every partition are distinguishable through a discriminator, which is a set of attributes.


Related Discussions:- Strong entity set and weak entity set

Evaluate the bulleted list of information-related items, Critically evaluat...

Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?

Explain concurrency problems, Question: a) There are three concurrency...

Question: a) There are three concurrency problems, i.e. three types of potential mistake which could occur if concurrency control is not properly enforced in the database syst

Explain about database system structure, Explain about database system stru...

Explain about database system structure? Storage manager Authorization and integrity manager Transaction manager File manager Buffer manager Storage manager

Joins, how can apply joins on table

how can apply joins on table

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

Multiple column queries-syntax, Multiple column Queries: Syntax: ...

Multiple column Queries: Syntax: SELECT COLUMN1, COL2,...... FROM TABLE WHERE (COLUMN1, COL2, ...) IN (SELECT COLUMN1, COL2,....  FROM TABLE WHERE );

Er schema, Consider entity type Employee with attributes empNumber (this is...

Consider entity type Employee with attributes empNumber (this is unique), empName, and the year when he/she was hired. An employee can either be a technical employee, a marketing e

Define timestamp ordering, Define Timestamp ordering Ans In timestamp-b...

Define Timestamp ordering Ans In timestamp-based method, a serial order is made among the concurrent transaction by assigning to every transaction a unique nondecreasing number

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