Given the relation schema R(A, B, C) and S(C, D, E), please match each of the following relational algebra expressions to the corresponding SQL (Structured Query Language) statement. (Assume R and S are union compatible) 1. RUS A. SELECT * FROM R MINUS SELECT * FROM S; 2. RNS B. SELECT * FROM S MINUS SELECT * FROM R: 3. R -S C. SELECT * FROM R CROSS JOIN S: 4. S -R D. SELECT * FROM R NATURAL JOIN S; 5. R* S E. SELECT FROM R JOIN S ON R.C = S.C: 6. R X S F. SELECT * FROM R JOIN S ON R.B = S.B: 7. RDARB- S.RS G. SELECT * FROM R UNION SELECT * FROM S: 8. RARC = s.cS H. SELECT * FROM R INTERSECT SELECT FROM S:
Given the relation schema R(A, B, C) and S(C, D, E), please match each of the following relational algebra expressions to the corresponding SQL (Structured Query Language) statement. (Assume R and S are union compatible) 1. RUS A. SELECT * FROM R MINUS SELECT * FROM S; 2. RNS B. SELECT * FROM S MINUS SELECT * FROM R: 3. R -S C. SELECT * FROM R CROSS JOIN S: 4. S -R D. SELECT * FROM R NATURAL JOIN S; 5. R* S E. SELECT FROM R JOIN S ON R.C = S.C: 6. R X S F. SELECT * FROM R JOIN S ON R.B = S.B: 7. RDARB- S.RS G. SELECT * FROM R UNION SELECT * FROM S: 8. RARC = s.cS H. SELECT * FROM R INTERSECT SELECT FROM S:
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
Transcribed Image Text:Question 5
Given the relation schema R(A, B, C) and S(C, D, E), please match each of the following relational algebra expressions to the corresponding SQL (Structured Query Language) statement.
(Assume R and S are union compatible)
1. RUS
A. SELECT * FROM R
MINUS
SELECT * FROM S:
2. ROS
B. SELECT
FROM S
MINUS
SELECT * FROM R:
3. R – S
C. SELECT * FROM R CROSS JOIN S;
4. S -R
D. SELECT * FROM R NATURAL JOIN S;
5. R* S
E. SELECT * FROM R JOIN S ON R.C = S.C:
6. R X S
F. SELECT * FROM R JOIN S ON R.B = S.B;
7. RDAR.B = S.BS G. SELECT FROM R
UNION
SELECT * FROM S:
8. RAR.C - S.S H. SELECT FROM R
INTERSECT
SELECT FROM S:
1
G
H
A
4
В
D
6
7
8
E
>
>
>
Expert Solution
Step 1: part 1
1-G 1. R U S === G. (From the given quetion) SELECT * FROM R UNION SELECT * FROM S;
Trending now
This is a popular solution!
Step by step
Solved in 8 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education