Let relations r1(A, B, C) and r2(C, D, E) have the following properties: r1 has20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block, and 30tuples of r2 fit on one block. Estimate the number of block transfers and seeksrequired using each of the following join strategies for r1 ⋈ r2: Hash join.

Hash join: Let assume no overflow occurs. Since, “r1” is smaller, the user uses it as the build…

Answered: Let relations r1(A, B, C) and r2(C, D,…

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

See similar textbooks

Related questions

Question

Let relations r₁(A, B, C) and r₂(C, D, E) have the following properties: r₁ has
20,000 tuples, r₂ has 45,000 tuples, 25 tuples of r₁ fit on one block, and 30
tuples of r₂ fit on one block. Estimate the number of block transfers and seeks
required using each of the following join strategies for r₁ ⋈ r₂: Hash join.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions