Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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}
What is a data dictionary? Data Dictionary is a main source of data in a data management system. Its major function is to carry the creation and management of data definition
Improved performance: As the data is located near the site of its demand, and given the inherent parallelism because of multiple copies, speed of database access may be good for di
State about the Tables- DBMS Data is stored in columns and rows (much like a spreadsheet -main difference is how data is organised). Every row in a table is known as a record
Give the Introduction of OBJECT DESIGN Strategies which are selected during system design are carried out in object-oriented design. In this procedure, objects which are identi
What are domain constraints? A domain is a set of values that might be assigned to an attribute .all values that appear in a column of a relation must be taken fro
Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher
Explain how the associations are implemented as classes. A general approach in this case is to transform an association class into a simple class linked to two original classes
Distributed query and transaction processing a. Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4
Set Difference If R1 and R2 are two union compatible relations or relations then result of R3 =R1- R2 is the relation that have only those tuples that are in R1 but not in R2.
The Structured Query Language INTRODUCTION Database is an organised set of information about an entity having controlled redundancy and serves numerous applications. DBMS
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd