Question
Assume two relations R(a,b) and S(a,c) stored in 150000 and 90000 pages, respectively. No index is created for these two relations. (a) Assume there are
Assume two relations R(a,b) and S(a,c) stored in 150000 and 90000 pages, respectively. No index
is created for these two relations.
(a)
Assume there are 400 buffer pages available. We want to have the output of join of R and S
sorted according to the attribute a.What join algorithm should we use to have the minimum cost?
What is the cost of this algorithm?
(b)
Assume that there are 50 buffer pages available. What is the fastest join algorithm to produce
the join of R and S? What is the cost of this algorithm?
(c)
Assume that there are 310 buffer pages available. What is the fastest join algorithm to produce
the join of R and S? What is the cost of this algorithm?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started