Data Mgmt Lab_Part_34

Data Mgmt Lab_Part_34 - 11 HASH-BASED INDEXING Exercise...

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

View Full Document Right Arrow Icon
11 HASH-BASED INDEXING Exercise 11.1 Consider the Extendible Hashing index shown in Figure 11.1. Answer the following questions about this index: 1. What can you say about the last entry that was inserted into the index? 2. What can you say about the last entry that was inserted into the index if you know that there have been no deletions from this index so far? 3. Suppose you are told that there have been no deletions from this index so far. What can you say about the last entry whose insertion into the index caused a split? 4. Show the index after inserting an entry with hash value 68. 2 2 2 1 52 1 10 15 7 16 41 2 20 000 001 010 011 100 101 110 111 3 3 3 DIRECTORY Bucket A Bucket B Bucket C Bucket D Bucket A2 64 51 36 Figure 11.1 Figure for Exercise 11.1 100
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 101 5. Show the index after inserting entries with hash values 17 and 69 into the original tree. 6. Show the index after deleting the entry with hash value 21 into the original tree.
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.

Page1 / 3

Data Mgmt Lab_Part_34 - 11 HASH-BASED INDEXING Exercise...

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