Question
Suppose we have the following relations: R(A,B,C) and S(D,E,F). Assume that R uses 500 blocks on disk, and S uses 6,000 blocks. Assume that you
Suppose we have the following relations: R(A,B,C) and S(D,E,F). Assume that R uses 500 blocks on disk, and S uses 6,000 blocks. Assume that you got the best possible hash function and there are no overflows for the hash. Assuming that there are 102 blocks of memory space for query processing, what is the least cost (in terms of disk block IOs) for partition hash join for the query R JOINC=D S?
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
Data Mining Concepts And Techniques
Authors: Jiawei Han, Micheline Kamber, Jian Pei
3rd Edition
0123814790, 9780123814791
