Use the following schema and query plan to answer the corresponding questions S(d,e,f,g) B(S) = 1000 T(S) = 10,000 T(T) = 10,000 V(S,e) = 10 R(a,b,c) T(h,ij) B(R) : = 1000 B(T) = 1000 %3D T(R) = 10,000 Min(R,a) = 0 Max(R,a) = 9000 V(S,f) = 100 V(R,b) = 100 V(R,c) = 20 %3| V(T,h) : = 100 %3D V(S,d) = 50 V(S,g) = 40 %3D (f) *a,b.c.g.lj R5 (e) g=h R4 (d) o b=100 v b=101 R3 T(B+ tree index on h) (c)| R2 R1 (a) o a> 100 a a c= 1000 (b) o . - 10 af = 1000 R (B+ tree index on a) (B+ tree index on (e,f) ) a. Compute the cardinality of all intermediate relations labeled R1 through R5 and the final result

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

Sub:- Computer Science

 

Use the following schema and query plan to answer the corresponding questions
R(a,b,c)
B(R) = 1000
T(R) = 10,000
Min(R,a)
Max(R,a) = 9000 V(S,f) = 100
V(R,b) = 100
V(R,c) = 20
S(d,e,f,g)
B(S)
T(S) = 10,000 T(T) = 10,000
V(S,e) = 10
T(h,ij)
= 1000
B(T) :
= 1000
%3D
%3D
V(T,h) = 100
= 0
%3D
%3D
%3D
V(S,d) = 50
V(S,g) =
= 40
(f) A
a,b.c.g.lj
R5
(e)
g=h
R4
(d) o b=100 v b=101
R3
T( B+ tree index on h)
(c)
R2
R1
(a) ở a> 100 a a <= 1000
(b) oe = 10 af= 1000
(B+ tree index on a)
(B+ tree
index on (e,f) )
a. Compute the cardinality of all intermediate relations labeled R1 through R5 and the final result
Transcribed Image Text:Use the following schema and query plan to answer the corresponding questions R(a,b,c) B(R) = 1000 T(R) = 10,000 Min(R,a) Max(R,a) = 9000 V(S,f) = 100 V(R,b) = 100 V(R,c) = 20 S(d,e,f,g) B(S) T(S) = 10,000 T(T) = 10,000 V(S,e) = 10 T(h,ij) = 1000 B(T) : = 1000 %3D %3D V(T,h) = 100 = 0 %3D %3D %3D V(S,d) = 50 V(S,g) = = 40 (f) A a,b.c.g.lj R5 (e) g=h R4 (d) o b=100 v b=101 R3 T( B+ tree index on h) (c) R2 R1 (a) ở a> 100 a a <= 1000 (b) oe = 10 af= 1000 (B+ tree index on a) (B+ tree index on (e,f) ) a. Compute the cardinality of all intermediate relations labeled R1 through R5 and the final result
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Complex Datatypes
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
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