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!
Explain the Cartesian product:
The Cartesian product operation does not need relations to union-compatible. The meaning of this is that the involved relations may have dissimilar schemas. Let R & S be relations that may have dissimilar schemas.
DEF: Cartesian product
The Cartesian product of relations R and S, denoted R X S, is the set of all probable combinations of tuples of the two operation relations. Every resultant tuple contains all the attributes of R and S.
The resultant relation has
Cardinality = (cardinality of R) * (cardinality of S); and
arity = (arity of R) + (arity of S).
For instance, in given table, STUDENT X MODULE is equal to
Explain what is Aggregation ? Aggregation: This is used whenever we intend to show a relationship between an entity and the relationship. There is no provision for this in th
Give the levels of data abstraction? There are three levels of Data Abstraction a) Physical level b) logical level c) view level
Define cardinality and participation constraints on a relationship type, completeness constraint on generalization. Ans: Cardinality defines the number of entities to wh
In this exercise you will create ten records, each containing the following fields: student name, class: Freshman, Sophomore, Junior or Senior, Major: Liberal Arts or General Sci
How do I use strap on?#
State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is
Create a view emp_dep containing e_name and number of dependents from the tables employee and dependent of (i) CREATE VIEW emp_dept AS SELECT ename, COUNT(*) FROM employee, dep
create an e-r diagram usuing graphical dipicted software that could theoritically be used in resturant application
Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.
Give short note on the following terms:Dirty pages and ETL a.) Dirty pages. These are buffer pages which comprise modifications which haven't been written to disk. b.
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