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

For known, What are the function of DBA?

What are the function of DBA?

I need help on the following 5 questions, 1. Define and discuss Work Breakd...

1. Define and discuss Work Breakdown Structure, Critical Path Analysis, PERT charts and GANTT charts. Describe the role of each in determining scope, budgets, and schedules? What

Insert statement reverses storage space and transfers value, A field-groups...

A field-groups statement or an insert statement reverses storage space and transfers values. False.

What is a super key, What is a super key? A super key is a set of one o...

What is a super key? A super key is a set of one or more attributes that collectively permits us to recognize uniquely an entity in the entity set.

How many types of locks are there, Depending upon the rules we have found, ...

Depending upon the rules we have found, we can classify the locks into two types. Shared Lock: A transaction might be acquiring shared lock on a data item in order to read it

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

When are two schedules said to be view equivalent, When are two schedules s...

When are two schedules said to be view equivalent?     Ans: Two schedules that is denoted as S and S' are said to be view equivalent if the subsequent three conditions are met

Hashed file organisation, Hashed File Organisation Hashing is the most ...

Hashed File Organisation Hashing is the most common form of purely random access to a database or file. It is also used to access columns that do not have an index as an optimi

What are metrics for choosing the best algorithm, What are metrics for choo...

What are metrics for choosing the best algorithm? Matrices for choosing the best algorithms are as below: Computational complexity Ease of understand ability and im

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