Modern disk drives store more sectors on the outer tracks than the inner tracks. Since the rotation speed is constant, the sequential data transfer rate is also higher on the outer tracks. The seek time and rotational delay are unchanged. Considering this information, explain good strategies for placing files with the following kinds of access patterns: 1. Frequent, random accesses to a small file (e.g., catalog relations). 2. Sequential scans of a large file (e.g., selection from a relation with no index). 3. Random accesses to a large file via an index (e.g., selection from a relation via the index).

Modern disk drives store more sectors on the outer tracks than the inner tracks. Since the rotation speed is constant, the sequential data transfer rate is also higher on the outer tracks. The seek time and rotational delay are unchanged. Considering this information, explain good strategies for placing files with the following kinds of access patterns: 1. Frequent, random accesses to a small file (e.g., catalog relations). 2. Sequential scans of a large file (e.g., selection from a relation with no index). 3. Random accesses to a large file via an index (e.g., selection from a relation via the index).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225KB,75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored ?
Consider a disk with the following characteristics: block size 512 bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double sided disks. Suppose the disk drive rotates the disk pack at an average speed of 2400 rpm (revolutions per minute) i) How much time in (msec) does one disk revolution take? ii) Using the total capacity of the track as 10240 bytes how many bytes will be transferred from the track in 1 msec (ie transfer rate in bytes/sec)
Consider a disc with 512-byte sectors, 1,000-track platters, 100-sector tracks, ten-track cylinders, and a block size of 2,048 bytes plus 48 bytes for non-data overhead. Assume that a file with 1,000,000 100-byte records is to be stored on such a disc, and that no record can transcend two blocks. a) How many recordings can fit on a single block? b) How many cylinders will be needed to store the complete file?
One disc makes 7200 revolutions per minute. There are 24 tracks on the disc and 8 sectors on each track. 2. A file saved in 2 consecutive sectors on the track and 4 consecutive sectors on track 20 will be read. The reader head of the disc is on the tenth (10) track when the reading starts. The transition time of the head from one track to another takes 10 ms. Assuming that there are 1024 bytes in each sector and the data transfer rate is equal to the rotation speed of the disk, what is the time to read one sector and read the entire file? 1,04 ms ; 274,54 ms C. 6,24 ms; 307,25 ms 8,3 ms; 180,75 ms 8,3 ms ; 298,5 ms
Suppose you have a 100GB database housed on a disk array that supports a transfer rate of 60MBps and a tape drive that supports 200GB cartridges with a transfer rate of 80MBps. How long will it take to back up the database? What is the transfer time if 2:1 compression is possible?
Disk requests come to disk driver for cylinders 10, 153, 34, 90, 120, 205, 319, 256 and 400 in that order at a time when the disk drive is reading from cylinder 99. The cylinders are numbered from 0 to 499. Compute the total head movement incurred while servicing these requests if the disk arm scheduling algorithm is first-come-first-serve.
It is possible to cut down on the amount of time spent waiting between accesses to various levels of the memory hierarchy by using buffers. Please list any feasible buffers that might be used between the L1 and L2 caches, as well as between the L2 cache and the RAM, for the given configuration.
A post calculation strategy for a factory indicates a disk with 200 blocks. Assuming, that the file control block contains the information given below. Perform an allocation for the specified files using contagious, linked and indexed allocation methods. (Note: Assume the end block, Index block wherever required)
What are the best-case, worst-case, and average-case access times for this disk? (Assume that the average seek operation must move 20 tracks.)
It is the operating system's responsibility to ensure that the blocks of a file are stored on the disk in the proper sequence when a file is opened. What is it about magnetic disks that makes this such an important consideration? Would it make a difference if solid-state drives (SSDs) were used instead, or would it be a non-issue? What is the reason behind this?
A file system with 300 GByte uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. Find the maximum possible file size in this file system.
Calculate how much disk space (in whole sectors and tracks) will be required to store 1GB (230 bytes) of data if a disk is single-zoned with 512 bytes/sector and 1024 sectors/track. Ignore any file header record(s) and track indices.