Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Assume we have a Shared Nothing System with 4 processing nodes and we want to implement a GRACE algorithm & ABJ algorithm with the following:

Assume we have a Shared Nothing System with 4 processing nodes and we want to implement a GRACE algorithm & ABJ algorithm with the following:
R S where R has 4,000 pages and S has 8,000 pages. Each relation is evenly divided among the four PNs. Thus, each PN has 3,000 pages of tuples. The Hashing Phase results in data skew as follows:
1)30% of the data in the first 8 bucket pairs: R0/S0- R7/S7
2)20% of the data in the second 8 bucket pairs: R8/S8 R15/S15
3)10% of the data in the third 8 bucket pairs: R16/S16 R23/S23
4)10% of the data in the fourth 8 bucket pairs: R24/S24 R31/S31
Calculate the read cost, write cost, and total computation cost for BOTH algorithms. Please explain thoroughly. Please note that the computation cost for the Hash Phase of the Grace Algorithm is determined by the slowest processing node (last to finish its workload), not the sum of the local computation costs of all the processing nodes. I need to understand the main difference for both algorithms.Assume we have a Shared Nothing System with 4 processing nodes and we want to implement a GRACE algorithm & ABJ algorithm with the following:
R S where R has 4,000 pages and S has 8,000 pages. Each relation is evenly divided among the four PNs. Thus, each PN has 3,000 pages of tuples. The Hashing Phase results in data skew as follows:
1)30% of the data in the first 8 bucket pairs: R0/S0- R7/S7
2)20% of the data in the second 8 bucket pairs: R8/S8 R15/S15
3)10% of the data in the third 8 bucket pairs: R16/S16 R23/S23
4)10% of the data in the fourth 8 bucket pairs: R24/S24 R31/S31
Calculate the read cost, write cost, and total computation cost for BOTH algorithms. Please explain thoroughly. Please note that the computation cost for the Hash Phase of the Grace Algorithm is determined by the slowest processing node (last to finish its workload), not the sum of the local computation costs of all the processing nodes. I need to understand the main difference for both algorithms.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access with AI-Powered Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Students also viewed these Databases questions

Question

on

Answered: 1 week ago