《数据库系统概念课后习题答案 Solutions to Practice Exercises10s》.pdfVIP

C H A P T E R 10 Storage and File Structure Practice Exercises 10.1 Answer: This arrangement has the problem that Pi and B4i −3 are on the same disk. So if that disk fails, reconstruction of B4i −3 is not possible, since data and parity are both lost. 10.2 Answer: a. It is stored as an array containing physical page numbers, indexed by logical page numbers. This representation gives an overhead equal to the size of the page address for each page. b. It takes 32 bits for every page or every 4096 bytes of storage. Hence, it takes 64 megabytes for the 64 gigabyte of flash storage. c. If the mapping is such that, every p consecutive logical page num- bers are mapped to p consecutive physical pages, we can store the mapping of the first page for every p pages. This reduces the in memory structure by a factor of p. Further, if p is an exponent of 2, we can avoid some of the least significant digits of the addresses stored. 10.3 Answer: a. To ensure atomicity, a block write operation is carried out as follows: i. Write the information onto the first physical block. ii. When the first write completes successfully, write the same in- formation onto the second physical block. iii. The output is declared completed only after the second write completes successfully. During recovery, each pair of physical blocks is examined. If both are identic