Suppose a relation is stored in a B+-tree file organization. Suppose secondary indices store record identifiers that
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 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?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Database System Concepts
ISBN: 9780078022159
7th Edition
Authors: Abraham Silberschatz, Henry F. Korth, S. Sudarshan
Question Posted: