✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
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.