Question: Suppose a relation is stored in a B+-tree file organization. Suppose secondary indices store record identifiers that are pointers to records on disk. a. What
Suppose a relation is stored in a B+-tree file organization. Suppose secondary indices store record identifiers that are pointers to records on disk.
a. What would be the effect on the secondary indices if a node split happened in the file organization?
b. What would be the cost of updating all affected records in a secondary index?
c. How does using the search key of the file organization as a logical record identifier solve this problem?
d. What is the extra cost due to the use of such logical record identifiers?
Step by Step Solution
3.15 Rating (157 Votes )
There are 3 Steps involved in it
a When a leaf page is split in a Btree file organization a number of records are moved to a new page ... View full answer
Get step-by-step solutions from verified subject matter experts
