This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS411 Database Systems Spring 2007 HW#3 Due: 1:55pm CST, 04/10/07 Note: Print your name and NetID in the upper right corner of every page of your submission. Handin your stapled homework to Trisha Benson in 4322 SC. In case Trisha is not in office, slide your homework under the door. To grade homeworks faster, ’The homework is partitioned into three parts. Please, submit each part separately. For each part, make sure to write down your name and NetID. This homework is partitioned into 3 parts as follows: • Part 1: Problem 1 - Problem 3 • Part 2: Problem 4 - Problem 6 • Part 3: Problem 7 - Problem 8 There is a bonus credit of 2% if your homework is formatted correctly: Each part must be separable so that it can be independently graded. If you submit a paper copy then each part should i) be separately stapled and ii) include your netid. For I2Cs students: If you submit an electronic copy (or fax) then each part should start on a new page and include your netid at the top of each page. Handwritten submissions will be graded but they will take longer to grade. For clarity, machine formatted text is preferable: Expect to lose points if your handwritten answer is unclear or misread by the grader. 1 Part 1 Problem 1 Merge-Sort Suggested reading: Chapter 11.4 Suppose we have a relation with 2.2 billion tuples and each tuple requires 300 bytes. We have a machine whose main memory and disk-block size (16,384 bytes) are sufficient to sort the 2 , 200 , 000 , 000 tuples using TPMMS (Two-Phase, Multiway Merge-Sort). Assume that no tuples are spanned over disk-blocks and there is no header information in a disk-block....
View Full Document
This note was uploaded on 09/14/2008 for the course CS 411 taught by Professor Winslett during the Spring '07 term at University of Illinois at Urbana–Champaign.
- Spring '07