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 the basic operations of the relational algebra?
Ans: Basic operators of relational algebra are:
1. Union (∪) - Selects tuples which are in either P or Q or in both of them. The duplicate tuples are removed.
R = P ∪ Q
2. Difference or Minus (-) - eliminates common tuples from the first relation.
R = P - Q
3. Cartesian Product or Cross Product (×) - The cartesian product of two relations is the concatenation of tuples that are belonging to the two relations and containing all possible combination of the tuples.
R = P× Q
4. Projection (π) - The projection of a relation is illustrated as a projection of all its tuples over some set of attributes that is it yields a vertical subset of the relation. The relation's projection T on the attribute A is presented by T [A] or πA(T),.
5. Selection (σ) - Selects just some of the tuples, those satisfy specified criteria, from the relation. It yields a horizontal subset of a following relation.
R = σB(P)
What are the two distinct aspects to the implementation of associations? i) It is required to define data declarations which will enable details of actual links to be stored. I
Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar
Mention the type of constraints we can specify in the CREATE command of DDL. The type of constraints that can be specified are as follows:- PRIMARY KEY, NOT NULL, UNIQUE, FOR
For Colorado customers calculate the number of single products ordered. If a product is purchased on multiple orders, it should be counted only single time. The result should conta
Explain the concept of a data model ? Data Model - Model is an abstraction procedure which hides irrelevant details although highlighting details relevant to the application
Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as
Cardinality of Relationship One-to-One Only one entity of the first set is linked to only one entity of the second set. E.g. A teacher teaches a student. Only one teacher
What are the purpose for having variable length records? What kinds of separator characters are required for each? Variable-Length Records - Variable-length records are thos
Sparse and Dense Indexes These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are: They are arranged
Produce a set of relations (equivalent to the Finkelstein entity list) in third normal form (3NF) from the following un-normalised relation. You must use the Finkelstein methodolog
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