Data Mgmt Lab_Part_31 - 91 Tree-Structured Indexing Root 8...

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

View Full Document Right Arrow Icon
Tree-Structured Indexing 91 Root 8 91* 99* 6* 5* 2* 1* 80* 73* 58* 46* 45* 41* 39* 32* 27* 18* 10* 8* 18 32 40 85 50 Figure 10.6 Root 8 6* 5* 2* 1* 45* 41* 39* 32* 27* 18* 10* 8* 18 32 40 50 99* 80* 73* 58* 52* 73 Figure 10.7 Root 8 6* 5* 2* 1* 45* 41* 39* 32* 27* 18* 10* 8* 18 32 40 50 99* 80* 73* 58* 52* 73 59* Figure 10.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
92 Chapter 10 6* 5* 2* 1* 27* 18* 10* 8* 52* 58* 80* 99* 91* Root 8 1 85 07 3 Figure 10.9 10 20 30 80 35 42 50 65 90 98 ABC 30* 31* 36* 38* 42* 43* 51* 52* 56* 60* 68* 69* 70* 79* 81* 82* 94* 95* 96* 97* 98* 99* 105* L1 L2 L3 L4 L5 L6 L7 L8 I1 I2 I3 100* Figure 10.10 Tree for Exercise 10.2 8. Considering checking the right sibling for possible merging Frst, the successive deletion of the data entries with keys 32, 39, 41, 45 and 73 results in the tree shown in Fgure 10.9. Exercise 10.2 Consider the B+ tree index shown in ±igure 10.10, which uses Alter- native (1) for data entries. Each intermediate node can hold up to Fve pointers and four key values. Each leaf can hold up to four records, and leaf nodes are doubly linked as usual, although these links are not shown in the Fgure. Answer the following questions.
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_31 - 91 Tree-Structured Indexing Root 8...

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