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!
Define cardinality and participation constraints on a relationship type, completeness constraint on generalization.
Ans: Cardinality defines the number of entities to which other entity can be related via a relationship set. It may be 1:1, 1: N or M: N.
In a relationship set Participation of an entity set can be total or partial. It is total if each entity participates in the relationship. If only a few entities participate in a relationship after that it is partial.
Completeness constraint may be partial or total. In the case of total every higher level entity must belong to a lower level entity and in the case of partial few higher level entities might not belong to lower level entities.
Give an example of enforcement in Typing. You can understand the idea of enforcement as it makes sure objects of dissimilar classes may not be interchanged as below: Exampl
Question 1 What are the advantages of DBMS approach in managing data? Question 2 What are the services provided by a database system Question 3 List and briefly describe
Dependency Preservation It is obvious that the decomposition must be lossless so that we do not lose any information from the relation that is decomposed. Dependency preservati
What are the advantages of DBMS ? 1. Centralized Management and Control - One of the major advantages of using a database system is in which the organization could exert, thr
explain equi-join using illustration
Determine the Derived attribute to avoid re-computation Each class box consists of an ordered list of attributes and operations, each represented as a next string. We can find
When are they useful? Justify with an example. The temporary tables are commonly used to support specialized rollups or exact application processing needs. Unlike a permanent t
What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec
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
Describe Application programming interface? Application Programming Interface - Commercial SQL implementations take one of the two primary techniques for involving SQL in a p
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd