Data Mgmt Lab_Part_38 - 112 Chapter 11 Level = 1 , N = 4 h1...

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

View Full Document Right Arrow Icon
112 Chapter 11 10 00 01 10 11 000 001 010 011 Level = 1 h h 0 1 , N = 4 64 92 5 5 Next = 1 31 15 7 3 63 00 100 44 Figure 11.8
Background image of page 1

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

View Full DocumentRight Arrow Icon
Hash-Based Indexing 113 1. Show an Extendible Hashing index with the same data entries. 2. Answer the questions in Exercise 11.9 with respect to this index. Answer 11.10 Answer omitted. Exercise 11.11 In answering the following questions, assume that the full deletion algorithm is used. Assume that merging is done when a bucket becomes empty. 1. Give an example of Extendible Hashing where deleting an entry reduces global depth. 2. Give an example of Linear Hashing in which deleting an entry decrements Next but leaves Level unchanged. Show the Fle before and after the deletion. 3. Give an example of Linear Hashing in which deleting an entry decrements Level . Show the Fle before and after the deletion. 4. Give an example of Extendible Hashing and a list of entries e 1 , e 2 , e 3 such that inserting the entries in order leads to three splits and deleting them in the reverse order yields the original index. If such an example does not exist, explain.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/17/2012 for the course EGN 4302 taught by Professor Dr.vishak during the Fall '12 term at University of Central Florida.

Page1 / 3

Data Mgmt Lab_Part_38 - 112 Chapter 11 Level = 1 , N = 4 h1...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online