# Tutorial4 - Problem 1: Indexing on Sequential Files Suppose...

This preview shows pages 1–3. Sign up to view the full content.

Problem 1: Indexing on Sequential Files Suppose we have a relation of 100 tuples. Each block can hold 2 tuples, or 10 key-pointer pairs. The index is built on the key field of the relation (thus no duplicate search keys) and the file is sorted according to the key. Answer the questions below about the space required for each index (just the index, not the data as well). 1. How many blocks do we need for a (clustered) dense index of this relation? 2. How many blocks do we need for a (clustered) sparse index of this relation? 3. The above questions referred to clustered indices, which can be dense or sparse. In contrast, an unclustered index is always dense. Why is this true?

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

View Full Document
Problem 2: B+ Tree Consider the B+ tree index shown in the figure below. For each problem below, you only need to show the final resulting B+ Tree. If you wish, you can just redraw the changed part of the tree. So, e.g., if only the values in 3 of the leaves need to change, note which part of the tree you are redrawing, redraw those 3 leaves, and note that the rest of the tree is unchanged. Please use rotation correctly when
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/17/2012 for the course CS 411 taught by Professor Winslett during the Fall '07 term at University of Illinois at Urbana–Champaign.

### Page1 / 5

Tutorial4 - Problem 1: Indexing on Sequential Files Suppose...

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

View Full Document
Ask a homework question - tutors are online