The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. To minimize the number of seeks in a sequential scan, many databasesallocate leaf pages in extents of n blocks, for some reasonably large n.When the first leaf of a B+-tree is allocated, only one block of an n-blockunit is used, and the remaining pages are free. If a page splits, and itsn-block unit has a free page, that space is used for the new page. If then-block unit is full, another n-block unit is allocated, and the first n∕2 leafpages are placed in one n-block unit and the remaining one in the secondn-block unit. For simplicity, assume that there are no delete operations. The technique of redistributing values to siblings to improve space utilization is likely to be more efficient when used with the preceding allocation scheme for leaf blocks. Explain why.
The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. To minimize the number of seeks in a sequential scan, many databases
allocate leaf pages in extents of n blocks, for some reasonably large n.
When the first leaf of a B+-tree is allocated, only one block of an n-block
unit is used, and the remaining pages are free. If a page splits, and its
n-block unit has a free page, that space is used for the new page. If the
n-block unit is full, another n-block unit is allocated, and the first n∕2 leaf
pages are placed in one n-block unit and the remaining one in the second
n-block unit. For simplicity, assume that there are no delete operations. The technique of redistributing values to siblings to improve space
utilization is likely to be more efficient when used with the preceding
allocation scheme for leaf blocks. Explain why.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
