7,114 views
39 votes
39 votes

With regards to the expressive power of the formal relational query languages, which of the following statements is true?

  1. Relational algebra is more powerful than relational calculus
  2. Relational algebra has the same power as relational calculus
  3. Relational algebra has the same power as safe relational calculus
  4. None of the above

4 Answers

Best answer
34 votes
34 votes

Answer: C

Relational algebra has the same power as safe relational calculus as:

  • A query can be formulated in safe Relational Calculus if and only if it can be formulated in Relational Algebra.
edited by
13 votes
13 votes

Option "B" is also correct but option "C" is more appropriate because Relational calculus have some unsafe operations and because of those unsafe operations sometimes it may fall in ∞(infinite) loop.

so relational algebra has the same power as safe relational calculus

2 votes
2 votes

A query can be written in safe Relational Calculus if and only if it can be written in Relational Algebra means it can be written in Relational Calculus as well as Relational Algebra, but Relational calculus also have some unsafe operations and because of those unsafe operations sometimes create ∞(infinite) loop.

So we can say that all safe relational calculus query can be translate into relational algebra

So Option (C) is the correct answer

Answer:

Related questions

33 votes
33 votes
2 answers
2
Kathleen asked Sep 15, 2014
5,605 views
The following table refers to search items for a key in $B$-trees and $B^+$ trees.$$\begin{array}{|ll|ll|} \hline & \textbf {B-tree} & & \textbf {B}^+\text{-tree} \\\hl...