Looking for INTRO. TO DATABASE MGMT. SYST. test answers and solutions? Browse our comprehensive collection of verified answers for INTRO. TO DATABASE MGMT. SYST. at moodlenew.iitd.ac.in.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Assume that the relation is stored on disk and that the following disk I/O costs apply:- Sequential page read cost: 0.005 seconds per page- Random page read cost: 0.015 seconds per page
For index-based access, assume that traversing the index requires one random I/O per level, and that the qualifying records (or their containing pages) are perfectly clustered in the data file.
Match the following scenarious to an access path that is likely to more efficient.
Increasing the number of buffers in an external sort always leads to a linear improvement in performance.