25
C H A P T E R 1 0
S
t
o
r
ag
e
and
F
il
e
S
t
r
u
c
t
u
r
e
E
x
e
r
c
i
s
e
s
10.1 If you have data that should not be lost on disk failure, and the data is write
intensive, how would you store the data?
. .
.3
10.4 Describe one benefit of each of RAID 5 and RAID 1 (mirroring) relative to each
other.
. .
.2
10.5 In disks in the past, the number of sectors per track was the same across all
tracks. These days, disks have more sectors per track on outer tracks, and fewer
sectors per track on inner tracks (since they are shorter in length). What is the
impact of such a change on each of the three main indicators of disk speed?
. .
.2
26 Chapter 10 Storage and File Structure
10.7 In a slotted page architecture, objects (tuples) are accessed indirectly via a header
table at the beginning of the page. That is, a tuple id gives a page-id and an offset in
the header table. Each entry in the table consists of a pointer (offset in the page) to an
10.8 (Buffer management)
a. Standard
buffer(cache)
managers assume each page is of the same size and costs
the same to read. Consider a cache manager that, instead of LRU, uses the rate-of-
reference to objects, i.e., how often an object has been accessed in the last n