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

Database ass1, #quCreate a database design specification (Enhanced Entity R...

#quCreate a database design specification (Enhanced Entity Relationship Diagram (EERD) and Relational Data Model (RDM)) from the given business description. The RDM must be in 3rd

Define deadlock detection, Define Deadlock detection If a system does ...

Define Deadlock detection If a system does not employ a few protocols that make sure deadlock freedom, after that a detection and recovery scheme should be used. An algorithm

What are partial and natural key, What are partial, alternate,, artificial,...

What are partial, alternate,, artificial, compound and natural key? Partial Key: It is a set of attributes that can uniquely recognize weak entities and that are related to s

What is a shadow copy scheme, What is a shadow copy scheme? It is simpl...

What is a shadow copy scheme? It is simple, but efficient, scheme known as the shadow copy schemes. It is based on making copies of the database called shadow copies that singl

What are decision support systems, Question: (a) What are decision sup...

Question: (a) What are decision support systems, and what role do they play in the business environment? (b) Data mining is a knowledge discovery process of automated extr

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

Explain data abstraction, Explain data abstraction? Data abstraction Da...

Explain data abstraction? Data abstraction Data abstraction is a methodology in which enables us to isolate how a compound data object is utilized from the details of how it is

Sequential file organisation, Sequential File Organisation The most nec...

Sequential File Organisation The most necessary way to organise the collection of records in a file is to use sequential Organisation. Records of the file are stored in series

Urgent need tutoring in conjunction with help on assignment!, Hi is anyone ...

Hi is anyone well versed in accounting information systems available now to help me work through an important assignment due tomorrow at noon?

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