# In answering the following questions, assume that the full deletion algorithm is used. Assume that merging is

## Question:

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 file before and after the deletion.

3. Give an example of Linear Hashing in which deleting an entry decrements Level. Show the file before and after the deletion.

4. Give an example of Extendible Hashing and a list of entries e1, e2, e3 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.

5. Give an example of a Linear Hashing index and a list of entries e1, e2, e3 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.

Fantastic news! We've Found the answer you've been seeking!

## Step by Step Answer:

**Related Book For**

## Database management systems

**ISBN:** 978-0072465631

3rd edition

**Authors:** Raghu Ramakrishan, Johannes Gehrke, Scott Selikoff