# A2 - as many records into a block as possible. (c ) What is...

This preview shows page 1. Sign up to view the full content.

- 1 - University of Waterloo School of Computer Science CS348 Spring 2009 Assignment 2 Due: June 2, 2009 20%1. Consider a disk storage system with 40,000 cylinders and with 10 recordable surfaces. Each track on a surface is divided into 80 blocks, and the block size is 2048 bytes. Suppose a sales transaction file has 100,000,000 fixed-length records. Each record has the following attributes: Transaction#(32 bytes), Customer#(12 bytes), SalesLocation#(12 bytes), SalesPersonnel#(12 bytes), Item#(16 bytes), Price (4 bytes) and Quantity(4 bytes). The file is stored on contiguous blocks and as an unspanned file on the disk storage system. You may assume 1MB = 1,000,000 bytes and 1 GB = 1,000 MBs. (a) What is the total capacity of disk storage system (in MB). (b) Calculate the blocking factor, that is, how many records can be fitted into a block, assuming that no record can span two or more blocks, and we try to place
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: as many records into a block as possible. (c ) What is the size (number of blocks) of the transaction file? Assuming that the file is tightly packed and records are unspanned. How many cylinders do we need to store this file? 80%2. Consider the following sequences of operations on an empty B +-tree of order 4. Each data node in the tree contains at least one record and at most 3 records. Explain clearly, with the help of intermediate trees, how the tree is grown or shrunk, as records are inserted into and deleted from the tree. The values in a sequence are the primary key values of records involved, and the content of the records are not given here. Denote a record in the tree with the primary key k as . k | * (a) Insert 5, 3, 88, 99, 7, 47, 1, 6, 10, 38, 36 (b) Delete 36, 10, 38, 88, 47...
View Full Document

## This note was uploaded on 10/23/2009 for the course CS 348 taught by Professor Woody during the Spring '09 term at Waterloo.

Ask a homework question - tutors are online