CS4482asg2q - CS4482 Advanced Database Systems Assignment 2...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS4482 Advanced Database Systems Assignment 2 Deadline: 27-NOV-2011 (Sunday), 11:55pm (no late submission will be accepted) Submission: Blackboard Format: word or pdf Points to note: o Different books may have different descriptions of concepts, algorithms and terminologies. To ensure uniformity in marking, you must follow the convention used in the lecture slides or our textbook (Database System Concepts, 6 th edition). Other conventions will not be accepted. o You must show the steps clearly. The markers will not give you marks if they cannot understand your work. 1. Parallel Databases [25%] Consider parallelizing R ( X , Y ) S ( Y , Z ) by partitioned hash-join in a 5-node shared-nothing machine, where R and S occupy 1,000 and 500 blocks, respectively. Assume that R and S are distributed uniformly and randomly among the 5 nodes, stored at their disks initially. Also assume that the final results can be kept at any node for later processing (i.e., no need to assemble the final results). (a) Show the steps for parallelizing the join operation. Include the steps for executing the join operation locally at each node. (b)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/11/2012 for the course CS CS4482 taught by Professor Drlee during the Winter '11 term at City University of Hong Kong.

Page1 / 3

CS4482asg2q - CS4482 Advanced Database Systems Assignment 2...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online