h*o
发帖数: 1 | 1 Any one know how to do this problem? Especially the second one.
Given a 32*32 2-dimensional regular grid of points to store on disk. You want
to store them with redundancy r = 1, on two virtual disks, but using 3 actual
disks and RAID 5. You can store B = 32 points per block.
1) Describe waht the contents of each disk.( in details)
2) What is exact worst case overhead, and name a query that gives it. |
|
