Retrieval performance of a B+-tree indexed file can be improved by keeping the upper part of the index tree resident in main memory.
Correct Answer:
Verified
Q66: The number of levels in a B+-tree
Q67: The way that data is retrieved, based
Q68: In an indexed-sequential file, an index is
Q69: The movement of a disk drive's access
Q70: The way that data is stored for
Q72: In a disk, once the access arm
Q73: The average rotational delay is one-half of
Q74: A record insertion in a B+-tree index
Q75: Every record insertion in a B+-tree indexed
Q76: The first step in indexing a file
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents