Register

GATE IT 2006 | Question: 15

16,560 views
61 61 votes

Which of the following relational query languages have the same expressive power?

  1. Relational algebra
  2. Tuple relational calculus restricted to safe expressions
  3. Domain relational calculus restricted to safe expressions
  1. II and III only
  2. I and II only
  3. I and III only
  4. I, II and III

7 Answers

Best answer
41 41 votes
Answer: D

All are equivalent in expressive power.
• selected by
1 1 vote

its option D

Because only safe TRC(Tuple Relational Calculus ) and DRC(Domain relational Calculus) is given in the question

0 0 votes
Relation algebra, tuple calculus and domain calculus are same in power.
0 0 votes

Relational algebra has same expressive power as relational calculus (tuple relational calculus and domain relational calculus)  and these all are relational query languages.

so option D is true

Page:
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GATE IT 2006 | Quest...Next → · GATE IT 2006 | Quest...
← Previous in category · GATE IT 2006 | Quest...Next in category → · GATE IT 2006 | Quest...
Position:
Show:

Related questions

1 1 vote
0 0 answers
1.2k
1.2k views
ajaysoni1924 asked Mar 26, 2019
1,156 views
DBMS Korth Edition 6 Exercise 6 Question 15 (Page No. 253-254)
Consider the employee database shown here. Give expressions in tuplerelational calculus and domain relational calculus for each of the followingqueries:a. Find the names ...
52 52 votes
3 answers 3 answers
14.2k
14.2k views
Ishrat Jahan asked Nov 1, 2014
14,163 views
GATE IT 2006 | Question: 72
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If only the root node does not satisfy...
25 25 votes
1 answers 1 answer
9.6k
9.6k views
Ishrat Jahan asked Oct 31, 2014
9,613 views
GATE IT 2006 | Question: 44
Which of the following sequences of array elements forms a heap?$\{23, 17, 14, 6, 13, 10, 1, 12, 7, 5\}$$\{23, 17, 14, 6, 13, 10, 1, 5, 7, 12\}$$\{23, 17, 14, 7, 13, 10, ...
48 48 votes
7 answers 7 answers
17.5k
17.5k views
Ishrat Jahan asked Oct 31, 2014
17,457 views
GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ isalways regularnever regularalways a deterministic context-free languagealways a...