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
Waterfall model is the linear model. The process is completed by step by step. We couldn't stop in between of the process. Prototype model: after get the model by low cost budget o
Describe an data dictionary? A data dictionary is a data structure which keeps meta data about the structure of the database ie. the schema of the database.
What are called multilevel indices? Indices with two or more levels are known as multilevel indices.
In which relational modes, cardinality is termed? Answer : Cardinality is termed in a number of tuples relational modes.
what is natural join?
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
Problem 1. Write an assembly program to find the smallest among two numbers Writing an assembly program to find the smallest among two numbers 2. Explain the intern
List the Armstrong's axioms for functional dependencies. What do you understand by soundness and completeness of these axioms? Ans: The Armstrong's axioms are: F1:
Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))
Discuss the differences among the candidate keys and the primary key of a relation. Give instance to describe your answer? A candidate key is one that can be used as primary ke
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