{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Data Mgmt Lab_Part_35

# Data Mgmt Lab_Part_35 - 103 Hash-Based Indexing 3 3 000 64...

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

Hash-Based Indexing 103 64 16 3 1 2 10 2 15 7 51 4 BUCKET A BUCKET BUCKET BUCKET BUCKET BUCKET B C D A2 000 001 010 011 100 101 110 111 17 3 3 3 5 21 69 3 B2 36 20 12 DIRECTORY Figure 11.3

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

View Full Document
104 Chapter 11 64 16 3 1 2 10 2 15 7 51 4 BUCKET A BUCKET BUCKET BUCKET BUCKET B C D A2 000 001 010 011 100 101 110 111 3 3 36 20 12 DIRECTORY 5 2 Figure 11.4 64 16 3 1 2 2 15 7 51 4 BUCKET A BUCKET BUCKET BUCKET BUCKET B C D A2 000 001 010 011 100 101 110 111 3 3 36 20 12 DIRECTORY 5 2 21 Figure 11.5
Hash-Based Indexing 105 h(0) h(1) 00 01 10 11 000 001 010 011 00 100 Next=1 PRIMARY PAGES OVERFLOW PAGES Level=0 32 8 24 9 25 17 10 30 18 14 31 35 7 11 36 44 41 Figure 11.6 Figure for Exercise 11.2 Exercise 11.2 Consider the Linear Hashing index shown in Figure 11.6. Assume that we split whenever an overﬂow page is created. 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 know that there have been no deletions from this index so far. What
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}