What is completeness constraint on generalization, Database Management System

Assignment Help:

What is completeness constraint on generalization? Define the variation between total and partial design constraint. Give an example each.    

 Ans: Completeness Constraints 

1. Total specialization  constraint

a. Each entity in the superclass should be a member of some subclass in the specialization for example {HOURLY_EMPLOYEE, SALARIED_EMPLOYEE} 

b. Notation: superclass 

2. Partial specialization constraint an entity might not belong to any type of the subclasses 

For example: {SECRETARY, ENGINEER, TECHNICIAN}


Related Discussions:- What is completeness constraint on generalization

There are two major types of fragmentation, There are two major types of fr...

There are two major types of fragmentation: Horizontal& Vertical. Horizontal fragments, as the name suggests are subsets of tuples and vertical fragments are subsets of attributes

Differentiate between logical database design and physical, Differentiate b...

Differentiate between logical database design and physical database design. Show how this separation leads to data independence? Basis Logical Databas

Write short notes on schema diagram, Write short notes on Schema diagram.  ...

Write short notes on Schema diagram.  A database schema along with primary key and foreign key dependencies can be depicted pictorially by schema  diagram. Every relation appea

Why are cursors necessary in embedded sql, Why are cursors necessary in emb...

Why are cursors necessary in embedded SQL? A cursor is an object used to store the output of a query for row-by-row processing through the application programs. SQL statements

Define 2nf normal form, 2NF Normal Form : A relation schema process R i...

2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

Define the one-way associations, One-way Associations When an associat...

One-way Associations When an association is traversed only in the one direction, then it is implemented as a pointer i.e.an attribute which contains an object reference. If mu

What is vertical fragmentation, What is vertical fragmentation? Vertica...

What is vertical fragmentation? Vertical fragmentation divides the relation by decomposing the scheme R of relation r.

Relational DB, Suppose R is a relation with attributes A1, A2,..., An. As a...

Suppose R is a relation with attributes A1, A2,..., An. As a function of n, tell how many superkeys R has, if: 1.1 The only key is A1. 1.2 The only key is A1 and A2. 1.3 The o

Deletion anomalies-data redundancy, Deletion Anomalies: Loss of important ...

Deletion Anomalies: Loss of important Information: In some cases, useful information may be lost when a tuple is deleted. For instance, if we delete the tuple corresponding to stu

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