hw5 - Polytechnic Institute of NYU Computer Science and...

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

View Full Document Right Arrow Icon
Polytechnic Institute of NYU April 15, 2011 Computer Science and Engineering Department CS 308, Spring 2011 Prof. Phyllis Frankl Problem Set #5 (due 9:30 a.m. May 3, 2011) Assume the latency/transfer-rate model of disk performance, where we estimate disk access times by allowing blocks that are consecutive on disk to be fetched with a single seek time and rotational latency cost (as shown in class). Assume pointers to disk blocks or to individual tuples are 8 bytes long. Assume the hard disk has 10ms average access time, and 100 MBytes/sec transfer rate. Assume the block size is 4 KB ( = 2 12 = 4096 bytes). Assume (unrealistically) that the whole 4KB is available for storing data, i.e. there is no space overhead. Consider the relations r(a , b, c) and s(b ,d) Assume attributes a and b are each 8 bytes long and attribute c is 16 bytes long, so each record of r occupies 32 = 2 5 bytes. Assume attribute d is 24 bytes long, so each record of s also occupies 32 = 2 5 bytes. Assume relation r
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 09/10/2011 for the course CS 308 taught by Professor Frankl during the Spring '11 term at NYU Poly.

Page1 / 2

hw5 - Polytechnic Institute of NYU Computer Science and...

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