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

Draw the E/R diagrams, for the following business rules . Identify all enti...

for the following business rules . Identify all entities, attributes, relationships, primary keys, cardinalities and constraints where appropriate 3. (9) An art museum owns a larg

Explain odbc, Explain ODBC? ODBC - Open DataBase Connectivity (ODBC) e...

Explain ODBC? ODBC - Open DataBase Connectivity (ODBC) enable the integration of SQL along with a general-reasons programming language.

Define the traditional system analysis and design, Define the Traditional S...

Define the Traditional System Analysis and Design Traditional System Analysis and Design (SAD) have three basic life cycle models. A typical software lifecycle consists of the

Draw enhanced er-diagram for hierarchy of a student database, Draw an EER d...

Draw an EER diagram that captures the "is-a" hierarchy of students in another simple database. The database captures both the "basic" information (say, student ID and student name)

Define the term- state, State The position of object at any moment is ...

State The position of object at any moment is called state. An object can have many states depend upon time. After receiving some input instructions, the object can change its

What is recursive closure and operation relational algebra, What is recursi...

What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec

Define the third normal form, Define the Third Normal Form: The third ...

Define the Third Normal Form: The third normal form (3NF) is a normal form employed in database normalization. 3NF was initially defined by E.F. Codd in 1971. Codd's definitio

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.

In an e-r diagram how attributes are represented, In an E-R diagram how att...

In an E-R diagram how attributes are represented ? In an E-R diagram attributes are represented in a ellipse.

Central database schema, Show a centralised schema to support the operation...

Show a centralised schema to support the operation of the system you have chosen, including in particular: the product catalogue; the outlets and respective stocks; customer record

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