DBMS Relational Algebra

Question 1

Whats Relational Algebra

Answer 1

Relational algebra is a procedural query language. It gives a step by step process to obtain the result of the query. It uses operators to perform queries.

Question 2

What are Binary and Unary Operators?

Answer 2

Unary:
Selection
Projection
Rename

Binary:
Joins
Cross-product
Set operators
Division

Question 2

What are Binary and Unary Operators?

Answer 2

Unary:
Selection
Projection
Rename

Binary:
Joins
Cross-product
Set operators
Division

Question 3

Explain Projection Operator

Answer 3

Selects specified attributes of a relation.
* It removes duplicate tuples (records) from the result.

Question 3

Explain Projection Operator

Answer 3

Selects specified attributes of a relation.
* It removes duplicate tuples (records) from the result.

Question 4

Explain Selection Operator

Answer 4

Selects tuples from a relation that satisfy a given
condition.

Question 5

Explain Selection Operator

Answer 5

Selects tuples from a relation that satisfy a given
condition.

Question 6

What comes first in the mixture of selection and proejection operators!? f

Answer 6

first write the projection opertor and then in bracket write the selection operator

Question 7

Write abt the operation of Cartesian or Cross Product

Answer 7

It will multiply each tuples of Relation-1 to each tuples of Relation-2.
* Attributes of Resultant Relation = Attributes of R1 + Attributes of R2
* Tuples of Resultant Relation = Tuples of R1 * Tuples of R2

Question 8

Write abt the operation of Natural/Inner Join?

Answer 8

Natural join will retrieve consistent data from multiple relations.
* It combines records from different relations that satisfy a given condition.

To perform a Natural Join there must be one common attribute (column) between two relations.

Question 9

Steps for performing Natural/Inner Join are?

Answer 9

Step – 1 It performs Cartesian Product
Step – 2 Then it deletes inconsistent tuples
Step – 3 Then it removes an attribute from duplicate attributes

Question 10

Whats Outer join?

Answer 10

Outer Join
* In natural join some records are missing, if we want that missing records than we have to use outer join.
To perform a Outer Join there must be one common attribute (column) between two relations.

Question 11

Operation of Left Outer Join?

Answer 11

Operation:
* Display all the tuples of the left relation even through there is no matching tuple in the right relation.
* For such kind of tuples having no matching, the attributes of right relation will be padded with NULL in resultant relation.

Question 12

Operation of Right Outer Join

Answer 12

Operation:
* Display all the tuples of right relation even through there is no matching tuple in the left relation.
* For such kind of tuples having no matching, the attributes of left relation will be padded with NULL in resultant relation.

Question 13

Operation of Full Outer Join

Answer 13

Operation:
* Display all the tuples of both of the relations. It also pads null values whenever required. (Left outer join + Right outer join)
* For such kind of tuples having no matching, it will be padded with NULL in resultant relation.

Question 14

Operation of Union Operator

Answer 14

Operation:
* It displays all the tuples/records belonging to the first relation (left relation) or the second relation (right
relation) or both.
* It also eliminates duplicate tuples (tuples present in both relations appear once).

Question 15

Operation of Intersect/ Intersection Operator

Answer 15

Operation:
* It displays all the tuples/records belonging to both relations. OR
* It displays all the tuples/records which are common from both relations.

Question 16

Operation of Minus/ Set difference Operator

Answer 16

Operation:
* It displays all the tuples/records belonging to the first relation (left relation) but not in the second relation
(right relation).

Question 17

What are the types of Functional Dependencies

Answer 17

Trivial FD:RHS is subset of LHS
Nontrivial FD: One of RHS attribute is not subset LHS.
Completely Non-Trivial FD: None of RHS attribute is subset of LHS.
Full Functional Dependency: In a relation, the attribute B is fully functional dependent on A if B is functionally dependent on A, but not on any proper subset of A.

Question 18

Partial Functional Dependency:

Answer 18

Partial Functional Dependency
In a relation, the attribute B is partial functional dependent on A if B is functionally dependent on
A as well as on any proper subset of A.

Question 19

Transitive Functional Dependency:

Answer 19

Transitive Functional Dependency
In a relation, if attribute(s) A →B and B →C, then A →C (means C is transitively depends on A via B).

Question 20

What are armstrong’s axioms

Answer 20

Armstrong’s axioms are a set of rules used to infer (derive) all the functional dependencies on a relational database.

Question 20

What are armstrong’s axioms

Answer 20

Armstrong’s axioms are a set of rules used to infer (derive) all the functional dependencies on a relational database.

Question 20

What are armstrong’s axioms

Answer 20

Armstrong’s axioms are a set of rules used to infer (derive) all the functional dependencies on a relational database.

Question 21

Whats a closure

Answer 21

Given a set of attributes α, the closure of α under F is the set of attributes that are functionally determined by α under F.

Question 22

Use of the closure is:

Answer 22

Use of Closure of Attributes: * To identify the additional FDs. * To identify the keys * To identify the equivalence of FD * To identify the standard form, canonical form or irreducible set of FD.

Question 23

What is Decomposition?

Answer 23

Decomposition is the process of breaking down given relation into two or more relations.

Question 24

Types of Decomposition?

Answer 24

Types of decomposition * Lossy decomposition * Lossless decomposition (non-loss decomposition)

Question 25

Properties of Decomposition?

Answer 25

Properties of Decomposition: * Lossless (Mandatory) * Dependency Preserving (Optional)

Question 26

What is Lossy Decomposition?

Answer 26

Lossy decomposition * The decomposition of relation R into R1 and R2 is lossy when the natural join of R1 and R2 does not yield the same relation as in R. * This is also referred as lossy-join decomposition.