Question
Suppose that relations r and s contain 20 and 30 blocks respectively, and the block nested-loop join algorithm is used to natural-join r and s.
Suppose that relations r and s contain 20 and 30 blocks respectively, and the block nested-loop join algorithm is used to natural-join r and s. What is the cost in terms of number of seeks and number of block transfers in a best case senarious? How many blocks of memory are required to achieve this cost in the best case senarous?
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
Modern Database Management
Authors: Heikki Topi, Jeffrey A Hoffer, Ramesh Venkataraman
13th Edition
0134773659, 978-0134773650
