This preview shows page 1. Sign up to view the full content.
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.
- Spring '09
- Computer Science