This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Part A: Indexing 1) Consider an initially empty extendible hashing index with a directory size of one, where the directory entry points to an empty bucket. Write down a sequence of data insertions into this index such that the final index structure has a directory size of eight. You should also draw the final index structure after the insertions (including the directory, buckets, hash entries, local depths and global depth). You can assume that each bucket can hold at most two data entries. 2) Consider an initially empty linear hashing index with one empty bucket. Write down a sequence of 5 data insertions into this index such that the final index structure has exactly one overflow bucket. You should also draw the final index structure after the insertions (including the position of the next pointer). You can assume that a split occurs whenever an overflow bucket is created. Further, you can assume that each bucket can hold at most two data entries. (6 points) 3) Consider a completely full B+tree of order 2 and height 5. Give the maximum number of entries that can be deleted from the B+tree so that its height remains 5. Your answer should be a number. can be deleted from the B+tree so that its height remains 5....
View
Full
Document
This note was uploaded on 02/24/2011 for the course CS 442 taught by Professor Mlittman during the Fall '08 term at Rutgers.
 Fall '08
 mlittman

Click to edit the document details