Computer Sciences > GATE 2014 SET-3 > Relational Algebra
What is the optimized version of the relation algebra expression πA₁ (πA₂ (σF₁ (σF₂ (r)))), where A₁, A₂ are sets of attributes in r with A₁ ⊆ A₂ and F₁, F₂ are Boolean expressions based on the attributes in r?
A
πA₁ (σ(F₁∧F₂) (r))
B
πA₁ (σ(F₁∨F₂) (r))
C
πA₂ (σ(F₁∧F₂) (r))
D
πA₂ (σ(F₁∨F₂) (r))

Correct : a

Similar Questions

Consider a database that has the relation schemas EMP (EmpId, EmpName, DepId), and DEPT(DeptName, DeptId). Note that the DepId can be permitted to be NULL in th...
#198 MCQ
Consider the following two relations, R(A,B) and S(A,C); The total number of tuples obtained by evaluating the following expression σB<C(R ⨝R.A=S.AS) is...
#871 Fill in the Blanks
The relation schema, Person(pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra operators...
#930 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......