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

How to create a table from existing table, How to create a table from exist...

How to create a table from existing table? Create table as e.g, To create a new table ‘N_emp' with employee names and their identification numbers only from employee ta

What is multilevel index, Multilevel Index The Multilevel Index is a m...

Multilevel Index The Multilevel Index is a modification of the secondary level index system. In this system we might be use even more number of levels in case the table is eve

What is ocr, What is OCR? OCR (Optical Character Recognition) is a tech...

What is OCR? OCR (Optical Character Recognition) is a technology that enables you to change different types of machine-readable documents, like scanned paper documents, PDF fil

Entity Relationship for music band managem modeliing, i am required to come...

i am required to come up with entities relationships, optionality and cardinality from a scenario. there is a night club and bookings for a musician band

Relation schema for student, Example RELATION SCHEMA for STUDENT: STU...

Example RELATION SCHEMA for STUDENT: STUDENT (Roll No: string, name: string, login: string, age: integer) RELATION INSTANCE

Bid Cunt, How do I use strap on?#

How do I use strap on?#

Explain the term- data flows, Explain the term- Data Flows Data Flows:...

Explain the term- Data Flows Data Flows: A data flow connects output of an object or process to input of another process or object. It represents an in-between data value wit

An Apriori algorithm, Submission Requirements All answers must be co...

Submission Requirements All answers must be computer generated (including text and diagrams). The hand-in version must include a header page (or with sufficient space)

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

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