2. Assume we have two relations R(A,B) and S(B,C). All three attributes (A, B, and C) are integer attributes. Assume that Relation R contains the following tuples: (1,2), (2,3), and (3,4). Assume that Relation S con- tains the following tuples (2,2), (2,3), (4,1) and (5,1). Recall that a key is a minimal superkey, and that a key is not a superkey. (a) Give an example of an attribute (combination) that cannot be a key for relation S. (b) How many tuples are in the result of the cross-product between R and S? (c) How many tuples are in the result of the following relational algebra expression: TA(R 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
icon
Related questions
Question

Give an example of an attitube (combination) that cannot be a key for relation s . 
How many tippets are in the result of the cross product between R and S . 
how many tuples are in the result of the following relational algebra expression .

2. Assume we have two relations R(A,B) and S(B,C). All three attributes (A, B, and C) are integer attributes.
Assume that Relation R contains the following tuples: (1,2), (2,3), and (3,4). Assume that Relation S con-
tains the following tuples (2,2), (2,3), (4,1) and (5,1). Recall that a key is a minimal superkey, and that a key
is not a superkey.
(a) Give an example of an attribute (combination) that cannot be a key for relation S.
(b) How many tuples are in the result of the cross-product between R and S?
(c) How many tuples are in the result of the following relational algebra expression: TA(R S)
Transcribed Image Text:2. Assume we have two relations R(A,B) and S(B,C). All three attributes (A, B, and C) are integer attributes. Assume that Relation R contains the following tuples: (1,2), (2,3), and (3,4). Assume that Relation S con- tains the following tuples (2,2), (2,3), (4,1) and (5,1). Recall that a key is a minimal superkey, and that a key is not a superkey. (a) Give an example of an attribute (combination) that cannot be a key for relation S. (b) How many tuples are in the result of the cross-product between R and S? (c) How many tuples are in the result of the following relational algebra expression: TA(R S)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Data Recovery Approaches
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education